One Point Union Cordial Labeling Of One Point Union Of Graphs Related To triple -Antena Of C6 and invariance.
Mukund V. Bapat · Journal of Emerging Technologies and Innovative Research · 2018
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-antena graph. A triple-antena graph also called as triple tail graph is obtained by attaching a path Pm to any three vertices which forms a path p3 in given graph C6. It is denoted by triple- tail(G,Pm) where G is given graph and all the three tails may or may not be identical to pm. We take G as C6 and restrict our attention to m = 2, and 3 in Pm.We have taken care that the sum of pendent edges on path on all the three vertices is same , in this case upto 2. 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 called as invariance of different structures of G(k) under cordial labeling