On the Edge-Balanced Index Sets of Complete Even Bipartite Graphs

Abstract

In 2009, Kong, Wang, and Lee introduced the problem of finding the edge-balanced index sets ($EBI$) of complete bipartite graphs $K_{m,n}$, where they examined the cases $n=1$, $2$, $3$, $4$, $5$ and the case $m=n$. Since then the problem of finding $EBI(K_{m,n})$, where $m\ge n$, has been completely resolved for the $m,n=$ odd, odd and odd, even cases. In this paper we find the edge-balanced index sets for complete bipartite graphs where both parts have even cardinality.

8 pages, 1 figure

References in corpus (2)

• A Solution to the Edge-Balanced Index Set Problem for Complete Odd Bipartite Graphs
• On the Edge-Balanced Index Sets of Odd/Even Complete Bipartite Graphs