• VERTEX EQUITABLE LABELING OF CERTAIN GRAPHS

S. TERESA AROCKIAMARY, J. MARIA ANGELIN VISITHRA*

Abstract


Let G be a graph with p vertices and q edges and . A vertex labeling   induces an edge labeling  defined by  for all edges uv. For  let  be the number of vertices v with . 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,  and the induced labels are 1, 2,…, q. In this paper we examine the vertex equitable labeling of Jewel graph, Quadrilateral snake and Alternate quadrilateral snake.


Keywords


Labeling, Vertex equitable labeling, Jewel graph, Quadrilateral snake, Alternate quadrilateral snake.

Full Text:

PDF


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 Unported License.
© 2010-2018 International Journal of Mathematical Archive (IJMA)
Copyright Agreement & Authorship Responsibility
Web Counter