^{1}

^{*}

^{2}

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

All graphs considered here are simple, finite, connected and undirected. We follow the basic notations and terminologies of graph theory as in [

A difference labeling f of a graph G is said to be k-equitable if for each weight induced by f on the edges of G appears exactly k times. If a graph G has a k-equitable labeling then G is said to be k-equitable. Equitable labeling of graphs was introduced by Bloom and Ruiz in [

Definition 1.1 [_{0} and be two adjacent vertices in T. Let u and v be two pendant vertices of T such that the length of the path u_{0}-u is equal to the length of the path -v. If the edge is deleted from T and u and v are joined by an edge uv, then such a transformation of T is called an elementary parallel transformation (or an ept, for short) and the edge is called transformable edge.

If by a sequence of ept’s, T can be reduced to a path, then T is called a T_{p} tree (transformed tree) and such sequence is regarded as a composition of mappings (ept’s) denoted by P, is called a parallel transformation of T. The path, the image of T under P is denoted as P(T).

A T_{p} tree and a sequence of two ept’s reducing it to a path are illustrated in

Definition 1.2 The corona of the graphs G_{1} and G_{2} is obtained by taking one copy of G_{1} (with p vertices) and p copies of G_{2} and then joining the vertex of G_{1} to every vertex of the copy of G_{2}.

Definition 1.3 Caterpillar is a tree with the property that the removal of its pendant vertices leaves a path.

Definition 1.4 The square graph G^{2} of a graph G has the vertex set with adjacent in G^{2} whenever in G.

denotes the smallest integer greater than or equal to x.

The concept of mean labeling was introduced by S. Somasundaram and R. Ponraj in [

the number of times the different vertex labels appear cannot differ by more than one. The induced edge labels are defined as the sum of the incident vertex labels. They proved that the graphs like path, bistar combs bipartite complete friendship graph for quadrilateral snake,

if and only if ladder graph arbitrary super division of a path and cycle with or are vertex equitable. Also they proved that the graph if Eulerian graph with n edges where or the wheel the complete graph if and triangular cactus with q edges where or 6 or 9 are not vertex equitable. Moreover they proved that if G is a graph with p vertices and q edges, q is even and then G is not vertex equitable.

Definition 1.5 [

and the induced edge labels are

P. Jeyanthi and A. Maheswari proved in [10,11] that tadpoles, C_{m} C_{n}, armed crowns, [P_{m};] and, , the graphs obtained by duplicating an arbitrary vertex and an arbitrary edge of a cycle C_{n}, total graph of P_{n}, splitting graph of P_{n}_{ }and fusion of two edges of a cycle C_{n }are vertex equitable graphs. In this paper, we establish the vertex equitable labeling of a T_{p}-tree, where T is a T_{p}-tree with even number of vertices, the bistar the caterpillar and the crown

Theorem 2.1 Let and be any two vertex equitable graphs with equitable labeling f and g respectively. Let u and v be the vertices of G_{1} and G_{2} respectively such that and Then the graph obtained from G_{1} and G_{2} by identifying the vertices u and v is a vertex equitable graph.

Proof. Clearly has edges and vertices. Let

Define

by for and for Clearly,

Therefore, and the labels of the edges of the copy of G_{1} are and the labels of the edges of the copy of G_{2} are Hence, is a vertex equitable graph.

Theorem 2.2 Let and be any two vertex equitable graphs with equitable labeling f and g respectively. Let u and v be the vertices of G_{1} and G_{2} respectively such that and Then the graph G obtained by joining u and v by an edge is vertex equitable.

Proof. Clearly G has edges and vertices. Let

Define

by if if The labels of the edges of the copy of G_{1} are and the labels of the edges of the copy of G_{2} are and

Hence, G is a vertex equitable graph.

Theorem 2.3 Every T_{p}-tree is a vertex equitable graph.

Proof. Let T be a T_{p}-tree with n vertices. By the definition of a transformed tree there exists a parallel transformation P of T such that for the path we have 1), 2) where is the set of edges deleted from T and is the set of edges newly added through the sequence of the epts P used to arrive the path Clearly, and have the same number of edges.

Now denote the vertices of successively as starting from one pendant vertex of right up to the other.

For define the labeling f as

Then f is a vertex equitable labeling of the path

Let be any edge of T with and be the ept that deletes this edge and add the edge where t is the distance of from and also the distance of from Let P be a parallel transformation of T that contains as one of the constituent epts.

Since is an edge of the path it follows that which implies Therefore and are of opposite parity.

The induced label of the edge is given by

Now

Therefore, we have and hence f is a vertex equitable labeling of the T_{p}-tree T.

An example for the vertex equitable labeling of a T_{p}- tree with 12 vertices is given in

Theorem 2.4 Let T be a T_{p}-tee with even number of vertices. Then the graph is a vertex equitable graph for all

Proof. Let T be a T_{p}-tree of even order m and the vertex set Let be the pendant vertices joined with by an edge. Then

By the definition of a T_{p}-tree, there exists a parallel transformation P of T such that for the path we have 1), 2) where is the set of edges deleted from T and is the set of edges newly added through the sequence of the epts P used to arrive the path Clearly, and have the same number of edges.

Now denote the vertices of successively as starting from one pendant vertex of right up to the other. The labeling f defined by

is a vertex equitable labeling graph.

Let be any edge of T with let be the ept that deletes this edge and adds the edge where t is the distance of from and also the distance of from Let P be a parallel transformation of T that contains as one of the constituent epts.

Since is an edge in the path it follows that which implies Therefore i and j are of opposite parity.

The induced label of the edge is given by

Therefore, we have and thus f is a vertex equitable labeling of

An example for the vertex equitable labeling of where T is a T_{p}-tree with 12 vertices is shown in

Let be a graph obtained from by attaching n pendant edges at one vertex and pendant edges at the other vertex.

Theorem 2.5 The bistar is a vertex equitable graph.

Proof. Let and and be the vertices adjacent to u and v respectively. Now, has edges and vertices. Define

by if and if Then f is a vertex equitable labeling of

Theorem 2.6 Let and

Then is a vertex equitable graph.

Proof. By Theorem 2.5, is a vertex equitable graph. Let be the corresponding vertex equitable labeling of Let Since Consider the graphs and The number of edges of the graph is.

Now,

Therefore, by Theorem 2.1, is a vertex equitable graph. Let be the corresponding vertex equitable labeling of Again the number of edges of is even.

Now take Hence Also

Therefore, by Theorem 2.1, is a vertex equitable graph and the number of edges is even. Proceeding like this, at the step we get is a vertex equitable graph where

Let be the corresponding vertex equitable labeling of Take

Clearly Now,

Therefore, is a vertex equitable graph.

An example for the vertex equitable labeling of if n is odd is given in

An example for the vertex equitable labeling of if n is even is given in

Theorem 2.7 The crown is a vertex equitable graph.

Proof: Let be the vertices of the cycle C_{n} and let v_{i} be the vertex adjacent to u_{i} for Then the vertex set and the edge set. Define for the following cases:

Case 1.

Case 2.

Case 3.

Case 4.

In all the above cases, f is a vertex equitable labeling. Hence is a vertex equitable graph.

An example for the vertex equitable labeling of is shown in

Theorem 2.8 The graph is a vertex equitable graph.

Proof. Let be the path Clearly, has n vertices and edges. Define

by Evidently, is a vertex equitable graph.