Let Z2 = {0, 1} and G = (V ,E) be a graph. A labeling f : V → Z2 induces an edge labeling f* : E →Z2 defined by f*(uv) = f(u).f (v). For i ε Z2 let vf (i) = v(i) = card{v ε V : f(v) = i} and ef (i) = e(i) = {e ε E : f*(e) = i}. A labeling f is said to be Vertex-friendly if | v(0) − v(1) |≤ 1. The vertex balance index set is defined by {| ef (0) − ef (1) | : f is vertex-friendly}. In this paper we completely determine the vertex balance index set of Kn, Km,n, Cn×P2 and Complete binary tree.
Adiga, C., Subbaraya, C., Shrikanth, A., & Sriraj, M. (2013). On vertex balance index set of some graphs. Bulletin of the Iranian Mathematical Society, 39(4), 627-634.
MLA
Ch. Adiga; C. K. Subbaraya; A. S. Shrikanth; M. A. Sriraj. "On vertex balance index set of some graphs". Bulletin of the Iranian Mathematical Society, 39, 4, 2013, 627-634.
HARVARD
Adiga, C., Subbaraya, C., Shrikanth, A., Sriraj, M. (2013). 'On vertex balance index set of some graphs', Bulletin of the Iranian Mathematical Society, 39(4), pp. 627-634.
VANCOUVER
Adiga, C., Subbaraya, C., Shrikanth, A., Sriraj, M. On vertex balance index set of some graphs. Bulletin of the Iranian Mathematical Society, 2013; 39(4): 627-634.
)