Show simple item record

dc.creatorbasher, mohamed basher
dc.date2020-11-12
dc.date.accessioned2021-01-29T12:45:35Z
dc.date.available2021-01-29T12:45:35Z
dc.identifierhttps://www.revistaproyecciones.cl/index.php/proyecciones/article/view/3856
dc.identifier10.22199/issn.0717-6279-2020-06-0091
dc.identifier.urihttps://revistaschilenas.uchile.cl/handle/2250/163980
dc.descriptionA graph G with |E(G)|=q, an injective function f : V (G) → {0, 2, 4, ..., 2q} is an even vertex odd mean labeling of G that induces the values {f(u)+f(v)}/{2} for the q pairs of adjacent vertices u,v are distinct. In this paper, we investigate an even vertex labeling for the calendula graphs. Moreover we introduce the definition of arbitrary calendula graph and prove that the arbitrary calendula graphs are also even vertex odd mean graphs.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/3856/3587
dc.rightsCopyright (c) 2020 mohamed basher basheren-US
dc.rightshttp://creativecommons.org/licenses/by/4.0en-US
dc.sourceProyecciones (Antofagasta, On line); Vol. 39 No. 6 (2020); 1515-1535en-US
dc.sourceProyecciones. Revista de Matemática; Vol. 39 Núm. 6 (2020); 1515-1535es-ES
dc.source0717-6279
dc.source10.22199/issn.0717-6279-2020-06
dc.subjectLabelingen-US
dc.subjectEven vertex odd mean labelingen-US
dc.subjectCalendula graphen-US
dc.subject05C78en-US
dc.subjectGraph labelling (graceful graphs, bandwidth, etc.)en-US
dc.titleOn even vertex odd mean labeling of the calendula graphsen-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