A Solution to the Edge-Balanced Index Set Problem for Complete Odd Bipartite Graphs
Abstract
In 2009, Kong, Wang, and Lee began work on the problem of finding the edge-balanced index sets (EBI) of complete bipartite graphs Km,n by solving the cases where n = 1, 2, 3, 4, and 5, and also the case where m = n. In 2011, Krop and Sikes expanded upon that work by finding EBI(Km,m-2a) for odd m > 5 and 1 <= a <= (m-3)/4. In this paper, we provide a general solution to the edge-balanced index set problem for all complete odd bipartite graphs, thereby concluding the problem for this case.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.