International Journal of Mathematics Trends and Technology
Volume 50 | Number 2 | Year 2017 | Article Id. IJMTT-V50P519 | DOI : https://doi.org/10.14445/22315373/IJMTT-V50P519
Here we discuss product cordiality of some fusion graphs.These graphs are obtained by fusing a copy of given graph G2at each vertex of G1. It is denoted by G1FG2.If G1 is not isomorphic to G2 then G1FG2 is not same as G2FG1.We obtain product cordial labeling of antenna graph,CnFk1,m ,(n = 3,4);SnFK1,mwhere Sn is shel on n-cycle.
[1] Bapat M.V. Some new families of product cordial raphs,Proceedings,Annual International conference ,CMCGS 2017, Singapore ,110- 115.
[2] Bapat M.V. Some vertex prime graphs and a new type of graph labelling Vol 47 part 1 yr2017 pg 23-29 IJMTT.
[3] Bapat M.V. Extended Edge Vertex Cordial Labelling Of Graph “ ,International Journal Of Math Archieves IJMA Sept 2017 issue.
[4] Bapat M.V. Ph.D.Thesis ,University of Mumbai 2004.
[5] Jonh Clark, D. A. Holtan Graph theory by allied publisher and world scientist.
[6] Harary,GraphTheory,Narosa publishing ,New Delhi.
[7] J.Gallian Electronic Journal Of Graph Labeling(Dynamic survey)2016.
[8] M. Sundaram, R. Ponraj, and S. Somasundaram, “Product cordial labeling of graph,” Bulletin of Pure and Applied Science, vol. 23, pp. 155–163, 2004.
Bapat Mukund V, "Product Cordial Labeling of Some Fusion Graphs," International Journal of Mathematics Trends and Technology (IJMTT), vol. 50, no. 2, pp. 125-129, 2017. Crossref, https://doi.org/10.14445/22315373/IJMTT-V50P519
PDF 
Abstract 
Keywords 
References 
Citation