Prime Labeling Of Goldner Harary 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 Goldner Harary graph admits prime labeling. We establish prime labeling using some graph operations such as duplication. Switching and fusion with few ideas.