Show simple item record

dc.creatorJeyanthi, P.
dc.creatorMaheswari, A.
dc.date2018-11-22
dc.date.accessioned2019-11-14T12:01:16Z
dc.date.available2019-11-14T12:01:16Z
dc.identifierhttps://www.revistaproyecciones.cl/article/view/3271
dc.identifier.urihttps://revistaschilenas.uchile.cl/handle/2250/113661
dc.descriptionLet 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 an odd vertex equitable even labeling is called an odd vertex equitable even graph. Here, we prove that the graph nC4-snake, CS(n1, n2, ..., nk), ni ≡ 0(mod4),ni ≥ 4, be a generalized kCn -snake, TÔQSn and TÕQSn are odd vertex equitable even graphs.en-US
dc.formatapplication/pdf
dc.languageeng
dc.publisherUniversidad Católica del Norte.es-ES
dc.relationhttps://www.revistaproyecciones.cl/article/view/3271/3008
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 4 (2018); 613-625en-US
dc.sourceProyecciones. Revista de Matemática; Vol. 37 Núm. 4 (2018); 613-625es-ES
dc.source0717-6279
dc.source0716-0917
dc.subjectvertex equitable labelingen-US
dc.subjectvertex equitable graphen-US
dc.subjectodd vertex equitable even labelingen-US
dc.subjectodd vertex equitable even graphen-US
dc.titleOdd Vertex equitable even labeling of cyclic snake related graphs.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