Some New Families of Prime Cordial Graphs

S K Vaidya, N H Shah
2011 Journal of Mathematics Research  
In this paper some new families of prime cordial graphs are investigated. We prove that the square graph of path P n is a prime cordial graph for n = 6 and n ≥ 8 while the square graph of cycle C n is a prime cordial graph for n ≥ 10. We also show that the shadow graph of K 1,n for n ≥ 4 and the shadow graph of B n,n are prime cordial graphs. Moreover we prove that the graphs obtained by mutual duplication of a pair of edges as well as mutual duplication of a pair of vertices from each of two copies of cycle C n admit prime cordial labeling.
doi:10.5539/jmr.v3n4p21 fatcat:mmf4ldmkqrhvvf47xfdaw6vxsm