Super vertex mean labeling of cycles through different ways.

dc.creator	Lourdusamy, A.
dc.creator	George, Sherry
dc.date	2018-06-05
dc.date.accessioned	2019-06-28T17:06:29Z
dc.date.available	2019-06-28T17:06:29Z
dc.identifier	http://www.revistaproyecciones.cl/article/view/2921
dc.identifier.uri	https://revistaschilenas.uchile.cl/handle/2250/101115
dc.description	A 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.format	application/pdf
dc.language	eng
dc.publisher	Universidad Católica del Norte.	es-ES
dc.relation	http://www.revistaproyecciones.cl/article/view/2921/2759
dc.rights	Derechos de autor 2018 Proyecciones. Journal of Mathematics	es-ES
dc.rights	https://creativecommons.org/licenses/by-nc/4.0/	es-ES
dc.source	Proyecciones. Journal of Mathematics; Vol 37 No 2 (2018); 181-198	en-US
dc.source	Proyecciones. Revista de Matemática; Vol. 37 Núm. 2 (2018); 181-198	es-ES
dc.source	0717-6279
dc.source	0716-0917
dc.title	Super vertex mean labeling of cycles through different ways.	en-US
dc.type	info:eu-repo/semantics/article
dc.type	info:eu-repo/semantics/publishedVersion
dc.type	Artículo revisado por pares	es-ES