Author(s)

P. Jeyanthi, A. Maheswari

Department of Mathematics, Kamaraj College of Engineering and Technology, Virudhunagar, India.
Research Centre, Department of Mathematics, Govindammal Aditanar College for Women, Tiruchendur, India.

Let G be a graph with p vertices and q edges and let A= vertex labeling is said to be a vertex equitable labeling of G if it induces an edge labeling given by such that and , where is the number of vertices v with for A graph G is said to be a vertex equitable graph if it admits vertex equitable labeling. In this paper, we establish the vertex equitable labeling of a Tp-tree, where T is a Tp-tree with even number of vertices, bistar the caterpillar and crown

Vertex Equitable Labeling; Vertex Equitable Graph

Jeyanthi, P. and Maheswari, A. (2012) Some Results on Vertex Equitable Labeling. Open Journal of Discrete Mathematics, 2, 51-57. doi: 10.4236/ojdm.2012.22009.