Total neighborhood prime labeling of some trees
Author
Rajesh Kumar, T. J.
Full text
https://www.revistaproyecciones.cl/index.php/proyecciones/article/view/481910.22199/issn.0717-6279-4819
Abstract
Let G be a graph with p vertices and q edges. A total neighborhood prime labeling of G is a labeling in which the vertices and edges are assigned labels from 1 to p + q such that the gcd of labeling in the neighborhood of each non degree 1 vertex is equal to 1 and the gcd of labeling in the edges of each non degree 1 vertex is equal to 1. A graph that admits a total neighborhood prime labeling is called a total neighborhood prime graph. In this paper, we examine total neighborhood prime labeling of trees such as (n, k, m) double star trees, spiders, caterpillars and firecrackers.