Prime Cordial Labeling of Some Graphs
By Samir Vaidya, Nirav Shah. 2012
49 citations recorded by the source corpus.
In this paper we prove that the split graphs of K1,n and Bn,n are prime cordial graphs. We also show that the square graph of Bn,n is a prime cordial graph while middle graph of Pn is a prime cordial graph for n≥4 . Further we prove that the wheel graph Wn admits prime cordial labeling for n≥8.
Subfields: Computational Theory and Mathematics
View Paper: https://www.semanticscholar.org/paper/815f3bf77208b88cd5dc247d09c0deb8c78acd55
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computational Theory and Mathematics
Citations in the corpus
- A Dynamic Survey of Graph Labeling (2009, background): “Vaidya and Shah [2585] proved that the square graph of a bistar, the splitting graph of a bistar, and the splitting graph of a star are graceful graphs.”