Year: 2024
Type: article
Abstract: 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.
Author: M. Ganeshan
Institution: University of Madras
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: diamond
OpenAlex ID: W4407044071