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

2015/09/06 by Ha Dao, Hung Hua, Dao, Ha +5
Computer Science · Engineering · Mathematics · #05C25 #05C78 #Combinatorics (math.CO) #FOS: Mathematics #Graph Labeling and Dimension Problems #Graph theory and applications #graph theory and CDMA systems

paper · pdf · doi:10.48550/arxiv.1509.01841

openalex publication_date 2015/09/06 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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 ≥ 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.

Citations

• A Solution to the Edge-Balanced Index Set Problem for Complete Odd Bipartite Graphs
• A Dynamic Survey of Graph Labeling

Related

• On the Edge-Balanced Index Sets of Odd/Even Complete Bipartite Graphs
• A Solution to the Edge-Balanced Index Set Problem for Complete Odd Bipartite Graphs
• On the Edge-balanced Index Sets of Complete Bipartite Graphs
• Spectral Conditions for the Bipancyclic Bipartite Graphs
• The number of independent sets in bipartite graphs and benzenoids