Share This Article:

Some Results on Vertex Equitable Labeling

Full-Text HTML XML Download Download as PDF (Size:343KB) PP. 51-57
DOI: 10.4236/ojdm.2012.22009    4,445 Downloads   8,749 Views Citations

ABSTRACT

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

Cite this paper

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

Copyright © 2020 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.