Author(s)

Samir K. Vaidya, Nirav H. Shah

.

In this paper we prove that the split graphs of K_1,n and B_n,n are prime cordial graphs. We also show that the square graph of B_n,n is a prime cordial graph while middle graph of P_n is a prime cordial graph for n≥4 . Further we prove that the wheel graph W_n admits prime cordial labeling for n≥8.

Prime Cordial Labeling; Split Graph; Square Graph; Middle Graph

S. Vaidya and N. Shah, "Prime Cordial Labeling of Some Graphs," Open Journal of Discrete Mathematics, Vol. 2 No. 1, 2012, pp. 11-16. doi: 10.4236/ojdm.2012.21003.