×

Prime cordial labeling of some graphs. (English) Zbl 1242.05245

Summary: 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\(\geq 4\) . Further we prove that the wheel graph \(W_{n}\) admits prime cordial labeling for n\(\geq 8\).

MSC:

05C78 Graph labelling (graceful graphs, bandwidth, etc.)
PDFBibTeX XMLCite
Full Text: DOI