Article citationsMore>>

J. A. Gallian, “A Dynamic Survey of Graph Labeling,” The Electronic Journal of Combinatorics, Vol. 17, 2010, DS6. http://www.combinatorics.org/Surveys/ds6.pdf

has been cited by the following article:

• TITLE: Prime Cordial Labeling of Some Graphs

  AUTHORS: Samir K. Vaidya, Nirav H. Shah

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

  JOURNAL NAME: Open Journal of Discrete Mathematics, Vol.2 No.1, January 20, 2012

  ABSTRACT: 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.