Show simple item record

Total neighborhood prime labeling of some trees

dc.creatorRajesh Kumar, T. J.
dc.date2022-01-28
dc.date.accessioned2022-08-30T15:59:41Z
dc.date.available2022-08-30T15:59:41Z
dc.identifierhttps://www.revistaproyecciones.cl/index.php/proyecciones/article/view/4819
dc.identifier10.22199/issn.0717-6279-4819
dc.identifier.urihttps://revistaschilenas.uchile.cl/handle/2250/207100
dc.descriptionLet 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.en-US
dc.formatapplication/pdf
dc.languageeng
dc.publisherUniversidad Católica del Norte.en-US
dc.relationhttps://www.revistaproyecciones.cl/index.php/proyecciones/article/view/4819/3983
dc.rightsCopyright (c) 2022 T. J. Rajesh Kumaren-US
dc.rightshttps://creativecommons.org/licenses/by/4.0en-US
dc.sourceProyecciones (Antofagasta, On line); Vol. 41 No. 1 (2022); 101-110en-US
dc.sourceProyecciones. Revista de Matemática; Vol. 41 Núm. 1 (2022); 101-110es-ES
dc.source0717-6279
dc.source10.22199/issn.0717-6279-2022-01
dc.subjecttotal neighborhood prime labelingen-US
dc.subjectdouble star treesen-US
dc.subjectspidersen-US
dc.subjectcaterpillarsen-US
dc.subjectfirecrackersen-US
dc.subject05C78en-US
dc.titleTotal neighborhood prime labeling of some treesen-US
dc.typeinfo:eu-repo/semantics/article
dc.typeinfo:eu-repo/semantics/publishedVersion
dc.typePeer-reviewed Articleen-US
dc.typetexten-US


This item appears in the following Collection(s)

Show simple item record