Total neighborhood prime labeling of some trees

• Rajesh Kumar, T. J. ^[1]
  1. [1] TKM College of Engineering.
• Localización: Proyecciones: Journal of Mathematics, ISSN 0716-0917, ISSN-e 0717-6279, Vol. 41, Nº. 1, 2022, págs. 101-110
• Idioma: inglés
• DOI: 10.22199/issn.0717-6279-4819
• Enlaces
  • Texto completo
• Resumen

  • 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.

• Referencias bibliográficas
  • 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....
  • S. K. Patel and N. P. Shrimali, “Neighborhood-prime labeling of some union graphs”, International journal of mathematics and soft computing,...
  • 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,...
  • N. P. Shrimali and P. B. Pandya, “Total neighborhood prime labeling of some graphs”, International journal of scientific research in mathematical...
  • A. Tout, A. N. Dabboucy and K. Howalla, “Prime labeling of graphs”, National Academy Science Letters, vol. 11, pp. 365-368, 1982.