Show simple item record

Analytic odd mean labeling of union and identification of some graphs

dc.creatorJeyanthi, P.
dc.creatorGomathi, R.
dc.creatorLau, G. C.
dc.creatorShiu, W. C.
dc.date2023-09-13
dc.date.accessioned2023-09-22T12:42:51Z
dc.date.available2023-09-22T12:42:51Z
dc.identifierhttps://www.revistaproyecciones.cl/index.php/proyecciones/article/view/3505
dc.identifier10.22199/issn.0717-6279-3505
dc.identifier.urihttps://revistaschilenas.uchile.cl/handle/2250/234426
dc.descriptionA graph G is analytic odd mean if there exist an injective function f  : V → {0, 1, 3, . . . , 2q − 1} with an induced edge labeling f∗ : E → Z such that for each edge uv with f(u) < f(v), is injective. Clearly the values of f∗ are odd. We say that f is an analytic odd mean labeling of G. In this paper, we show that the union and identification of some graphs admit analytic odd mean labeling by using the operation of joining of two graphs by an edge.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/3505/4363
dc.rightsCopyright (c) 2023 P. Jeyanthi, R. Gomathi, G. C. Lau, W. C. Shiuen-US
dc.rightshttps://creativecommons.org/licenses/by/4.0en-US
dc.sourceProyecciones (Antofagasta, On line); Vol. 42 No. 5 (2023); 1141-1155en-US
dc.sourceProyecciones. Revista de Matemática; Vol. 42 Núm. 5 (2023); 1141-1155es-ES
dc.source0717-6279
dc.source10.22199/issn.0717-6279-2023-05
dc.subjectmean labelingen-US
dc.subjectanalytic mean labelingen-US
dc.subjectanalytic odd mean labelingen-US
dc.subjectanalytic odd mean graphen-US
dc.subject05C78en-US
dc.titleAnalytic odd mean labeling of union and identification of some graphsen-US
dc.typeinfo:eu-repo/semantics/article
dc.typeinfo:eu-repo/semantics/publishedVersion
dc.typetexten-US


This item appears in the following Collection(s)

Show simple item record