Total neighborhood prime labeling of some trees
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.
Saved in:
| Main Author: | |
|---|---|
| Format: | Digital revista |
| Language: | English |
| Published: |
Universidad Católica del Norte, Departamento de Matemáticas
2022
|
| Online Access: | http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172022000100101 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | 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. |
|---|