3-Total Sum Cordial Labeling of Some SpecialGraphs

  • A.Neerajah et. al


Let us consider simple, finite, connected and undirected graph. By assigning 0, 1 and 2 to the vertices we assign values to the edges that satisfy the condition [f(u)+f(v)] (mod 3). Thus, by using the above properties here to prove that few special graph namely wheel graph, globe graph, vertex switching graph, vertex duplication graph and helm graph are 3-total sum cordialgraphs.

Keywords:Cordial labeling,3-total sum cordial labeling,helm graph.

How to Cite
et. al, A. (2020). 3-Total Sum Cordial Labeling of Some SpecialGraphs. International Journal of Advanced Science and Technology, 29(04), 434 - 447. Retrieved from http://sersc.org/journals/index.php/IJAST/article/view/4577