Neighborhood-Prime Labelings of Trees and Other Classes of Graphs
From MaRDI portal
Abstract: A neighborhood-prime labeling of a graph is a variation of a prime labeling in which the vertices are assigned labels from to such that the of the labels in the neighborhood of each non-degree vertex is equal to . 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.
Recommendations
- Total neighborhood prime labeling of some trees
- Vertex-edge neighborhood prime labeling of some trees
- New perspectives on neighborhood-prime labelings of graphs
- New perspectives on neighborhood-prime labelings of graphs
- scientific article; zbMATH DE number 6889695
- scientific article; zbMATH DE number 1416061
- scientific article; zbMATH DE number 1439467
- scientific article; zbMATH DE number 867700
- Neighborhood homogeneous labelings of graphs
- scientific article; zbMATH DE number 6277710
Cited in
(8)- scientific article; zbMATH DE number 6889695 (Why is no real title available?)
- New perspectives on neighborhood-prime labelings of graphs
- Neighborhood-prime labeling of snake graphs
- Total neighborhood prime labeling of some trees
- New perspectives on neighborhood-prime labelings of graphs
- Vertex-edge neighborhood prime labeling of some trees
- Prime labeling in the context of web graphs without center
- Vertex-edge neighborhood prime labeling in the context of corona product
This page was built for publication: Neighborhood-Prime Labelings of Trees and Other Classes of Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5124184)