A graph labeling is an assignment of integers to the vertices or edges, or both, subject to
certain conditions. Graph labelings were first introduced in the mid 1960s. In the intervening …

A vertex labeling ξ of a graph χ is referred to as a'vertex equitable labeling (VEq.)'if the
induced edge weights, obtained by summing the labels of the end vertices, satisfy the …

The concept of vertex equitable labeling was introduced in [9]. 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 …

Let G be a graph with p vertices 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 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 …

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 …

VERTEX EQUITABLE LABELING FOR LADDER AND SNAKE RELATED GRAPHS 1.
Introduction All graphs considered here are simple, finite, con Page 1 Journal of Prime …

Even vertex equitable even labeling for snake related graphs Page 1 Even vertex equitable
even labeling for snake related graphs A. Lourdusamy St. Xavier’s College, India S. Jenifer …

Edge pair sum labeling of some classes of graphs Page 1 Š Edge pair sum labeling of some
classes of graphs P. Jeyanthi † Research Centre Department of Mathematics Govindammal …

Let G be a graph having vertex set V (G), edge set E (G),| V (G)|= p,| E (G)|= q, and 𝒜 be {0,
1, 2,…,[q 2]}⁠. A vertex equitable labeling of G is a labeling f: V (G)→ 𝒜 that induces a …