• Publications
• Influence

Claim Your Author Page
Ensure your research is discoverable on Semantic Scholar. Claiming your author page allows you to personalize the information displayed and manage publications.
• 2008
Let G = (V, E) be a graph with a vertex labeling f : V --> £2 that induces an edge labeling r : E --> defined by r(xy) f(x) + fey)· For each i E £2, let Vf(i) card{v E V : f(v) i} and ef(i) = card{e(More)
• 2
• Discrete Mathematics
• 2008
Let G=(V,E) be a graph, a vertex labeling f:V->Z"2 induces an edge labeling f^*:E->Z"2 defined by f^*(xy)=f(x)+f(y) for each [email protected]?E. For each [email protected]?Z"2, define(More)
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(More)
• Australasian J. Combinatorics
• 2009
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(More)