| dc.creator | Jeyanthi, P. | |
| dc.creator | Maheswari, A. | |
| dc.creator | Vijayalakshmi, M. | |
| dc.date | 2017-04-06 | |
| dc.identifier | http://www.revistaproyecciones.cl/article/view/1394 | |
| dc.identifier | 10.4067/S0716-09172017000100001 | |
| dc.description | In 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 thatfor 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-ES |
| dc.format | application/pdf | |
| dc.language | spa | |
| dc.publisher | Universidad Católica del Norte. | es-ES |
| dc.relation | http://www.revistaproyecciones.cl/article/view/1394/1190 | |
| dc.rights | Derechos de autor 2017 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 36 No 1 (2017); 1-11 | en-US |
| dc.source | Proyecciones. Revista de Matemática; Vol. 36 Núm. 1 (2017); 1-11 | es-ES |
| dc.source | 0717-6279 | |
| dc.source | 0716-0917 | |
| dc.title | Odd vertex equitable even labeling of graphs | es-ES |
| dc.type | info:eu-repo/semantics/article | |
| dc.type | info:eu-repo/semantics/publishedVersion | |
| dc.type | Artículo revisado por pares | es-ES |
