3-Total Edge Sum Cordial Labeling for Some Star Related Graphs

Abstract

For a graph G = (V (G), E(G), In this paper deal with the edge labeling function  f: E(G) → {0, 1, 2} and induced vertex labeling function : V (G) →{0, 1, 2} given as if e₁,e₂,...,e_n are the edge incident on vertex  v then  = f(e₁ ) f (e₂)  ..., f (e_n).  Then   the map   f  is called 3-Total edge sum

Cordial labeling of graph G  if  ≤ 1;i,j∈ {0,1, 2}.Where and denotes the total number of vertices and edges with i = {0,1, 2}. In this paper, we prove some graphs  like  double star K_1,n,n,  Coconut tree CT(m,n), K_1,n⊙K_1,2, Subdivision of  bistar S(B_m,n ) are

3-Total edge sum cordial graph.