2013/07/30 by Elliot Krop, Sarah Minion, Krop, E. +5 · 2 citations
Computer Science · Engineering · #05C25 #05C78 #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Graph Labeling and Dimension Problems #graph theory and CDMA systems
paper · pdf · doi:10.48550/arxiv.1307.8071
openalex publication_date 2013/07/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.