TY - JOUR

T1 - An algebraic approach for finding balance index sets

AU - SHIU, Wai Chee

AU - Kwong, Harris

N1 - Copyright:
Copyright 2009 Elsevier B.V., All rights reserved.

PY - 2009/10

Y1 - 2009/10

N2 - Any vertex labeling f : V →{0,1} of the graph G = (V,E) induces a partial edge labeling f* : E → {0,1} defined by f*(uv)= f (u)if and only if f (u)= f (v). The balance index set of G is defined as {\f *-1 (0) - f| \f-1 (0) - f-1 (1) ≤1}. In this paper, we propose a new and easier approach to find the balance index set of a graph. This new method makes it possible to determine the balance index sets of a large number of families of graphs in an unified and uniform manner.

AB - Any vertex labeling f : V →{0,1} of the graph G = (V,E) induces a partial edge labeling f* : E → {0,1} defined by f*(uv)= f (u)if and only if f (u)= f (v). The balance index set of G is defined as {\f *-1 (0) - f| \f-1 (0) - f-1 (1) ≤1}. In this paper, we propose a new and easier approach to find the balance index set of a graph. This new method makes it possible to determine the balance index sets of a large number of families of graphs in an unified and uniform manner.

UR - http://ajc.maths.uq.edu.au/?page=get_volumes&volume=45

UR - http://www.scopus.com/inward/record.url?scp=70349472779&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:70349472779

VL - 45

SP - 139

EP - 155

JO - Australasian Journal of Combinatorics

JF - Australasian Journal of Combinatorics

SN - 1034-4942

ER -