Let G be a graph with p vertices and q edges and A = {0, 1, 2, · · · , 2q }. 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 vf (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, |vf (a) - vf (b)| = 1 and the induced edge labels are 1, 2, 3, · · · , q. In this paper, we prove that triangular ladder T Ln, Ln ? mK1, Qn ? K1, T Ln?K1 and alternate triangular snake A(Tn) are vertex equitable graphs.