@article {
author = {Adiga, Ch. and Subbaraya, C. and Shrikanth, A. and Sriraj, M.},
title = {On vertex balance index set of some graphs},
journal = {Bulletin of the Iranian Mathematical Society},
volume = {39},
number = {4},
pages = {627-634},
year = {2013},
publisher = {Iranian Mathematical Society (IMS)},
issn = {1017-060X},
eissn = {1735-8515},
doi = {},
abstract = {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.},
keywords = {Vertex labeling,Vertex-friendly,Vertex balance index set},
url = {http://bims.iranjournals.ir/article_434.html},
eprint = {http://bims.iranjournals.ir/article_434_8a847dac9d4c818761d9e8df959e4b3a.pdf}
}