Prime Labeling of Nauru Graph

Abstract

A graph G = (V(G), E(G)) is observed to admit prime labeling, if a graph that receives prime labeling is called prime graph .In this research article we investigate that the Nauru graph admits prime labeling. We construct the mirror graph and shadow graph of the Nauru graph. We also establish prime labeling using some graph operations such as duplication. switching and fusion with few ideas.