Show simple item record

dc.creatorJeyanthi, P.es
dc.creatorMaheswari, A.es
dc.creatorVijayalakshmi, M.es
dc.date2017-04-06
dc.date.accessioned2025-10-06T15:05:05Z
dc.date.available2025-10-06T15:05:05Z
dc.identifierhttps://www.revistaproyecciones.cl/index.php/proyecciones/article/view/1394
dc.identifier10.4067/S0716-09172017000100001
dc.identifier.urihttps://revistaschilenas.uchile.cl/handle/2250/255519
dc.descriptionIn this paper, we introduce a new labeling called odd vertex equitable even labeling. Let G be a graph with p vertices and q edges and A = {1, 3,..., q} if q is odd or A = {1, 3,..., q + 1} if q is even. A graph G is said to admit an odd vertex equitable even labeling if there exists a vertex labeling f : V(G) → A that induces an edge labeling f * defined by f * (uv) = f (u) + f (v) for all edges uv such that for all a and b in A, |vf (a) —vf (b)| ≤ 1 and the induced edge labels are 2, 4,..., 2q where vf (a) be the number of vertices v with f (v) = a for a ∈ A. A graph that admits odd vertex equitable even labeling is called odd vertex equitable even graph. We investigate the odd vertex equitable even behavior of some standard graphs.es
dc.formatapplication/pdf
dc.languagespa
dc.publisherUniversidad Católica del Norte.en
dc.relationhttps://www.revistaproyecciones.cl/index.php/proyecciones/article/view/1394/1190
dc.rightsCopyright (c) 2017 Proyecciones. Journal of Mathematicsen
dc.sourceProyecciones (Antofagasta); Vol. 36 No. 1 (2017); 1-11en
dc.sourceProyecciones. Revista de Matemática; Vol. 36 Núm. 1 (2017); 1-11es
dc.source0717-6279
dc.source10.22199/issn.0717-6279-2017
dc.titleOdd vertex equitable even labeling of graphses
dc.typeinfo:eu-repo/semantics/article
dc.typeinfo:eu-repo/semantics/publishedVersion


This item appears in the following Collection(s)

Show simple item record