| dc.creator | Lourdusamy, A. | |
| dc.creator | Wency, S. Jenifer | |
| dc.creator | Patrick, F. | |
| dc.date | 2019-02-26 | |
| dc.identifier | http://www.revistaproyecciones.cl/article/view/3418 | |
| dc.description | Let G be a graph with p vertices and q edges and A = {0,2,4,···, q+1} if q is odd or A = {0,2,4,···,q} if q is even. A graph G is said to be an even 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 even vertex equitable even labeling is called an even vertex equitable even graph. In this paper, we prove that S(D(Qn)), S(D(Tn)), DA(Qm) ʘ nK1, DA(Tm) ʘ nK1, S(DA(Qn)) and S(DA(Tn)) are an even vertex equitable even graphs. | 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/3418/3107 | |
| dc.rights | Derechos de autor 2019 Proyecciones. Revista de Matemática | es-ES |
| dc.rights | https://creativecommons.org/licenses/by-nc/4.0/ | es-ES |
| dc.source | Proyecciones. Journal of Mathematics; Vol 38 No 1 (2019); 177-189 | en-US |
| dc.source | Proyecciones. Revista de Matemática; Vol. 38 Núm. 1 (2019); 177-189 | es-ES |
| dc.source | 0717-6279 | |
| dc.source | 0716-0917 | |
| dc.title | Even vertex equitable even labeling for snake related graphs. | 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 |
