Gaussian Neighborhood Prime Labeling of Some Classes of Graphs and Cycles
Rajesh Kumar T.J, Mathew Varkey T K · Annals of Pure and Applied Mathematics · 2018
A graph G on n vertices is said to have a neighborhood prime labeling if there exists a labeling from the vertices of G to the first n natural numbers such that for each vertex in G with degree greater than one, the neighborhood vertices have relatively prime labels.Gaussian integers are the complex numbers whose real and imaginary parts are both integers.We extend the neighborhood prime labeling concept to Gaussian integers.Using the order on the Gaussian integers, we show that some classes of graphs and cycles are Gaussian neighborhood prime graphs.