PRIME LABELING IN THE CONTEXT OF DUPLICATION OF VERTICES
S. Meena · Journal of Global Research in Mathematical Archives(JGRMA) · 2018
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 , wheel ,Gear graph ,Friendship graph and Double triangular snake . We discuss prime labeling in the context of the graph operation namely duplication. Keywords : Graph Labeling, Prime Labeling, Duplication, Prime Graphs.