Deretsky, T., Lee, S.M. and Mitchem, J. (1991) On Vertex Prime Labelings of Graphs. In: Alvi, J., Chartrand, G., Oellerman, O. and Schwenk, A., Eds., Graph Theory, Combinatorics and Applications. Proceedings of the 6th International Conference Theory and Applications of Graphs, Wiley, New York, 359-369.

has been cited by the following article:

• TITLE: Some Results on Prime Labeling

  AUTHORS: U. M. Prajapati, S. J. Gajjar

  KEYWORDS: Graph Labeling, Prime Labeling, Switching of a Vertex, Switching Invariance

  JOURNAL NAME: Open Journal of Discrete Mathematics, Vol.4 No.3, June 27, 2014

  ABSTRACT: In the present work we investigate some classes of graphs and disjoint union of some classes of graphs which admit prime labeling. We also investigate prime labeling of a graph obtained by identifying two vertices of two graphs. We also investigate prime labeling of a graph obtained by identifying two edges of two graphs. Prime labeling of a prism graph is also discussed. We show that a wheel graph of odd order is switching invariant. A necessary and sufficient condition for the complement of Wn to be a prime graph is investigated.