Show simple item record

dc.creatorLourdusamy, A.
dc.creatorGeorge, Sherry
dc.date2018-06-05
dc.date.accessioned2019-11-14T12:01:13Z
dc.date.available2019-11-14T12:01:13Z
dc.identifierhttps://www.revistaproyecciones.cl/article/view/2921
dc.identifier.urihttps://revistaschilenas.uchile.cl/handle/2250/113631
dc.descriptionA super vertex mean labeling f of a (p, q) - graph G = (V,E) is defined as an injection from E to the set {1, 2, 3, ··· , p + q} that induces for each vertex v the label defined by the rule fv(v) = Round  , where Ev denotes the set of edges in G that are incident at the vertex v, such that the set of all edge labels and the induced vertex labels is {1, 2, 3, ··· , p + q}. In this paper, we investigate the super vertex mean labeling behavior of cycles by giving various ways by which they can be labeled.en-US
dc.formatapplication/pdf
dc.languageeng
dc.publisherUniversidad Católica del Norte.es-ES
dc.relationhttps://www.revistaproyecciones.cl/article/view/2921/2759
dc.rightsDerechos de autor 2018 Proyecciones. Journal of Mathematicses-ES
dc.rightshttps://creativecommons.org/licenses/by-nc/4.0/es-ES
dc.sourceProyecciones. Journal of Mathematics; Vol 37 No 2 (2018); 181-198en-US
dc.sourceProyecciones. Revista de Matemática; Vol. 37 Núm. 2 (2018); 181-198es-ES
dc.source0717-6279
dc.source0716-0917
dc.subjectSuper Vertex Mean labelen-US
dc.subjectCyclesen-US
dc.subjectTypes of labelingen-US
dc.titleSuper vertex mean labeling of cycles through different ways.en-US
dc.typeinfo:eu-repo/semantics/article
dc.typeinfo:eu-repo/semantics/publishedVersion
dc.typeArtículo revisado por pareses-ES


This item appears in the following Collection(s)

Show simple item record