| dc.creator | Jeyanthi, P. | es |
| dc.creator | Maheswari, A. | es |
| dc.creator | Vijayalakshmi, M. | es |
| dc.date | 2017-03-23 | |
| dc.date.accessioned | 2025-10-06T15:04:53Z | |
| dc.date.available | 2025-10-06T15:04:53Z | |
| dc.identifier | https://www.revistaproyecciones.cl/index.php/proyecciones/article/view/1226 | |
| dc.identifier | 10.4067/S0716-09172016000200003 | |
| dc.identifier.uri | https://revistaschilenas.uchile.cl/handle/2250/255396 | |
| dc.description | Let G be a graph with p vértices and q edges and A = {0,1, 2,..., [q/2]}. A vertex labeling f : V(G) → A induces an edge labeling f * defined by f *(uv) = f (u) + f (v) for all edges uv. For a ∈ A, let vf (a) be the number of vertices v with f (v) = a. A graph G is said to be vertex equitable if there exists a vertex labeling f such that for all a and b in A, |vf(a) — vfb)| ≤ 1 and the induced edge labels are 1, 2, 3,...,q. In this paper, we prove that key graph KY(m, n), P(2.QSn), P(m.QSn), C(n.QSm), NQ(m) and K1,n X P2 are vertex equitable graphs. | es |
| dc.format | application/pdf | |
| dc.language | spa | |
| dc.publisher | Universidad Católica del Norte. | en |
| dc.relation | https://www.revistaproyecciones.cl/index.php/proyecciones/article/view/1226/939 | |
| dc.rights | Copyright (c) 2016 Proyecciones. Journal of Mathematics | en |
| dc.rights | https://creativecommons.org/licenses/by/4.0 | en |
| dc.source | Proyecciones (Antofagasta); Vol. 35 No. 2 (2016); 177-186 | en |
| dc.source | Proyecciones. Revista de Matemática; Vol. 35 Núm. 2 (2016); 177-186 | es |
| dc.source | 0717-6279 | |
| dc.source | 10.22199/issn.0717-6279-2016 | |
| dc.title | Vertex equitable labeling of union of cyclic snake related graphs | es |
| dc.type | info:eu-repo/semantics/article | |
| dc.type | info:eu-repo/semantics/publishedVersion | |
