2014/05/07 by Hung Hua, Hua, Hung, Christopher Raridan +1
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.1405.1673
openalex publication_date 2014/05/07 · 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 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 an article soon to be published, Krop, Minion, Patel, and Raridan concluded the edge-balanced index set problem for complete bipartite graphs with both parts of odd cardinality. In this paper, we conclude the problem for complete bipartite graphs where the larger part is of odd cardinality and the smaller is of even cardinality.