• VERTEX EQUITABLE LABELING OF ALTERNATE SNAKE GRAPHS

Abstract

Let G be a graph with p vertices and q edges and A = {0, 1, 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 , let v_f (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,  and the induced edge labels are 1, 2, 3,…, q. In this paper, we investigate some new families of vertex equitable graphs.