No Detail Found!

Vertex equitable labeling for ladder and snake related graphs

Author(s)
A. LOURDUSAMY Department of Mathematics, St.Xavier’s College, Palayamkottai-627002, India.
F. PATRICK Department of Mathematics, St.Xavier’s College, Palayamkottai-627002, India.
Abstract
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.
Publication Details
Page(s) 1-7
DOI DOI not available
Published Journal: Journal of Prime Research in Mathematics, Volume: 13, Issue: 1, Year: 2017

Request the full text from PASTIC

Keywords
Snake, , 05C78, Vertex equitable labeling, AMS SUBJECT, ladder
References
Gallian J. A. .2014 .A Dyamic Survey of Graph Labeling, The Electronic J. , 17 : DS6.
Harary F. .1972 .. , : .
Jeyanthi P.,Maheswari A.,Vijayalaksmi M. .2015 .Vertex Equitable Labeling of Cycle and Star Related Graphs. J. Sci. Res, 7(3) : 33-42.
Sandhya S.,Somasundaram S.,Anusa S. .2014 .. International Journal of Mathematical Archive, 5(12) : 130-135.
Seenivasan M. .2013 .. Ph.D. thesis, : .
0

Citations

0

Downloads

38

Views