• 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 double-tail graph. A double-tail graph is obtained by attaching a path Pm to a pair of adjacent vertices of given graph. It is denoted by double-tail(G,Pm) where G is given graph. We take G as S4 and restrict our attention to m = 2 in Pm and consider upto four pendent edges each attached at a pair of adjacent vertices. Further we consider all possible structures of G(k) by changing the common point in one point union and obtain non-isomorphic structures. We show all these structures as cordial graphs. This is called as invariance of different structures of G(k) under cordial labeling.For S4 There are two types of double tail graphs. In type I we attach pendent edges to adjacent vertices of cycle C4.In type II the pendent edges are fused at end of chord.In both cases we show invariance under cordial labeling.

cordial, one point union, double-tail graph, tail graph, cycle, labeling,

"Cordial Labeling Of One Point Union Of Double -Tail S4 Garphs and invariance.", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.5, Issue 6, page no.142-149, June-2018, Available :http://www.jetir.org/papers/JETIR1806523.pdf

"Cordial Labeling Of One Point Union Of Double -Tail S4 Garphs and invariance.", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.5, Issue 6, page no. pp142-149, June-2018, Available at : http://www.jetir.org/papers/JETIR1806523.pdf