Some Results on Prime Labeling ()
Affiliation(s)
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.
KEYWORDS
Share and Cite:
Copyright © 2024 by authors and Scientific Research Publishing Inc.
This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.