Total neighborhood prime labeling of some trees
DOI:
https://doi.org/10.22199/issn.0717-6279-4819Keywords:
total neighborhood prime labeling, double star trees, spiders, caterpillars, firecrackersAbstract
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.
References
J. A. Gallian, “A dynamic survey of graph labeling”, The electronic journal of combinatorics, #DS6, 2019.
F. Harary, Graph theory. Boston: Addison Wesley, 1972.
S. K. Patel and N. P. Shrimali, “Neighborhood prime labeling”, International Journal of Mathematics and Soft Computing, vol. 5, no. 2, pp. 135-143, 2015. [On line]. Available: https://bit.ly/33oIfVF
S. K. Patel and N. P. Shrimali, “Neighborhood-prime labeling of some union graphs”, International journal of mathematics and soft computing, vol. 6, no. 1, pp. 39–47, 2016. https://doi.org/10.26708/ijmsc.2016.1.6.04
C. Pomerance and J. L. Selfridge, “Proof of D. J. Newmans coprime mapping conjecture”, Mathematika, vol. 27, no. 1, pp. 69–83, 1980. https://doi.org/10.1112/s0025579300009955
T. J. Rajesh Kumar and T. K. Mathew Varkey, “A Note on total neighborhood prime labeling”, International journal of pure and applied mathematics, vol.118, no. 4, pp. 1007-1013, 2018. [On line]. Available: https://bit.ly/3HTJmLR
N. P. Shrimali and P. B. Pandya, “Total neighborhood prime labeling of some graphs”, International journal of scientific research in mathematical and statistical sciences, vol. 5, no. 6, pp. 157-163, 2018. [On line]. Available: https://bit.ly/3rcscCk
A. Tout, A. N. Dabboucy and K. Howalla, “Prime labeling of graphs”, National Academy Science Letters, vol. 11, pp. 365-368, 1982.
Published
How to Cite
Issue
Section
Copyright (c) 2022 T. J. Rajesh Kumar
This work is licensed under a Creative Commons Attribution 4.0 International License.
-
Attribution — You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
- No additional restrictions — You may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.
