3-Total Sum Cordial Labeling of Some SpecialGraphs

Abstract

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.