• Mukund V.Bapat

We discuss graphs of type G(k) i.e. one point union of k-copies of G for cordial labeling. We take G as triple-tail graph. A triple-tail graph is obtained by attaching a path Pm to any three vertices which forms a path p3 in given graph C5. It is denoted by triple- tail(G,Pm) where G is given graph and all the three tails are identical to pm. We take G as C5 and restrict our attention to m = 2, and 3 in Pm. Further we consider all possible structures of G(k) by changing the common point and obtain non-isomorphic structures. We show all these structures as cordial graphs. This is invariance of different structures of G(k) under cordial labeling.

cordial, one point union, triple-tail graph, cycle, labeling, vertex

"Cordial Labeling Of One Point Union Of Graphs Related To triple -Tail Of C5 and invariance", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.5, Issue 5, page no.813-818, May-2018, Available :http://www.jetir.org/papers/JETIR1805878.pdf

"Cordial Labeling Of One Point Union Of Graphs Related To triple -Tail Of C5 and invariance", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.5, Issue 5, page no. pp813-818, May-2018, Available at : http://www.jetir.org/papers/JETIR1805878.pdf