Prime Labeling of Bull Graph
M. Ganeshan · Communications on Applied Nonlinear Analysis · 2024
Let G be a graph. A bijection f:V→ {1,2,…..|V|} is called a prime labeling [3] if for each edge e=uv in E, we have GCD{ f(u),f(v)}=1. A graph that admits a prime labeling is said to be a prime graph. In this paper we show that bull graph admits Prime labeling in the context of variety graph operations namely duplication of vertex, fusion of vertices and Switching in Bull graph.