2018/01/05 by Malori Cloys, Cloys, Malori, N. Bradley Fox +1
Computer Science · Engineering · #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Graph Labeling and Dimension Problems #graph theory and CDMA systems
paper · pdf · doi:10.48550/arxiv.1801.01802
openalex publication_date 2018/01/05 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
A neighborhood-prime labeling of a graph is a variation of a prime labeling in which the vertices are assigned labels from 1 to |V(G)| such that the gcd of the labels in the neighborhood of each non-degree 1 vertex is equal to 1. In this paper, we examine neighborhood-prime labelings of several classes of graphs such as polygonal snakes and books, with a focus on trees including caterpillars, spiders, and firecrackers.