International Journal of Mathematics Trends and Technology
Volume 57 | Number 5 | Year 2018 | Article Id. IJMTT-V57P544 | DOI : https://doi.org/10.14445/22315373/IJMTT-V57P544
We discuss graphs of type G(k) i.e. one point union of k-copies of G for cordial labeling.We take G as tail graph. A tail graph ( orantenna graph) is obtained by attaching a path Pm to a vertex of given graph. It is denoted by tail(G,Pm) where G is given graph. We take G as C3 and restrict our attention to m = 2,3,4 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 called as invariance of different structures of G(k)under cordial labeling.
[1] M. Andar, S. Boxwala, and N. Limaye, New families of cordial graphs, J. Combin. Math. Combin. Comput., 53 (2005) 117-154. [134]
[2] M. Andar, S. Boxwala, and N. Limaye, On the cordiality of the t-ply Pt(u,v), ArsCombin., 77 (2005) 245-259. [135]
[3] BapatMukund,Ph.D. thesis submitted to university of Mumbai.India 2004.
[4] BapatMukund V. Some Path Unions Invariance Under Cordial labeling,accepted IJSAM feb.2018 issue.
[5] I.Cahit, Cordial graphs: a weaker version of graceful and harmonious graphs, ArsCombin., 23 (1987) 201-207.
[6] Harary,Graph Theory,Narosapublishing ,New Delhi
[7] Yilmaz,Cahit,E-cordial graphs,Arscombina,46,251-256.
[8] J.Gallian, Dynamic survey of graph labeling,E.J.C 2017
[9] D. WEST,Introduction to Graph Theory,Pearson Education Asia.
a. 1Mukund V. Bapat, Hindale, Tal: Devgad,Sindhudurg
b. Maharashtra, India 416630
c. mukundbapat@yahoo.com
Mukund V. Bapat, "One Point Union Families and Invariance under Cordial Labeling," International Journal of Mathematics Trends and Technology (IJMTT), vol. 57, no. 5, pp. 313-319, 2018. Crossref, https://doi.org/10.14445/22315373/IJMTT-V57P544
PDF 
Abstract 
Keywords 
References 
Citation