Different operations of Sunlet graph Sn

Abstract

In this paper, we clarify that the Sunlet diagram Sn has concedes Vertex Prime labeling. At the point when the graph has Vertex Prime labeling that diagram is called Vertex Prime graph. A Graph $G=(V, E)$ is said to have a Vertex Prime labeling if its edges can be marked with unmistakable whole numbers from $\{1,2,3, \ldots,|E|\}$ with the end goal that for every vertex of degree at least two, the Greatest Common Divisor of the names on its occurrence edges is 1 . We also prove that Vertex Prime labeling in the context of the operations of namely duplication, fusion and switching of a vertex.