• Total 3 – SUM CORDIAL LABELING
Abstract
Suppose G = (V(G), E(G)) is a graph with vertex set V(G) and edge set E(G). Let be a map from V (G) to {0, 1, 2}. For each edge uv, assign the label (mod 3). The mapis called Total 3-sum cordial labeling of G, if for and i, j Î{0, 1, 2} wheredenotes the number of vertices and edges labeled with (=0,1,2). Here we prove some graphs like Path, Star, Double Star, Cycle and Wheel are Total 3-sum cordial graphs.
Keywords
Total 3-sum cordial labeling, Total 3-sum cordial graphs.
Full Text:
pdfThis work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
© 2010-2024 International Journal of Mathematical Archive (IJMA) Copyright Agreement & Authorship Responsibility |