Abstract
Let G be a (p,q) graph. A mapping f : V (G) → {0, 1, 2} is called 3-product cordial labeling if |v????(i) − v???? (j)| ≤ 1 and |e???? (i) − e???? (j)| ≤ 1 for any i, j ∈ {0, 1, 2},where v???? (i) denotes the number of vertices labeled with i, e???? (i) denotes the number of edges xy with ????(x)????(y) ≡ i(mod3). A graph with 3-product cordial labeling is called 3-product cordial graph. In this paper we investigate the 3-product cordial behavior of alternate triangular snake, double alternate triangular snake and triangular snake graphs.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
