Some New Families of Prime Labeling of Graphs
Abstract: A Graph G with n vertices is said to admit prime labeling if its vertices can be labeled with distinct positive integers not exceeding n such that the labels of each pair of adjacent vertices are relatively prime. A graph G which admits prime labeling is called a prime graph. In this paper we investigate the existence of prime labeling of some graphs related to cycle Cn, wheel W_n, comb P_n^*, crown C_n^*, and helm H_n. We discuss prime labeling in the context of the graph operation namely duplication.
Keywords: Graph Labeling, Prime Labeling, Duplication, Prime Graphs
How to Cite?: S. Meena, J. Naveen, "Some New Families of Prime Labeling of Graphs", Volume 5 Issue 9, September 2016, International Journal of Science and Research (IJSR), Pages: 109-113, https://www.ijsr.net/getabstract.php?paperid=ART20161341, DOI: https://dx.doi.org/10.21275/ART20161341