TY - JOUR AU - Lourdusamy, A. AU - Wency, S. Jenifer AU - Patrick, F. PY - 2019/02/26 Y2 - 2024/03/28 TI - Even vertex equitable even labeling for snake related graphs. JF - Proyecciones (Antofagasta, On line) JA - Proyecciones (Antofagasta, On line) VL - 38 IS - 1 SE - DO - UR - https://www.revistaproyecciones.cl/index.php/proyecciones/article/view/3418 SP - 177-189 AB - 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. ER -