A solution to the edge-balanced index set problem for complete odd bipartite graphs

MaRDI QIDQ3189192zbMATH OpenFDO

Authors Elliot Krop, Sarah Minion, Pritul Patel, Christopher Raridan

Publication date 9 September 2014

Full work available at URL https://arxiv.org/abs/1307.8071

zbMATH Keywords

complete bipartite graphvertex-labelingedge-labelingedge-balanced index setedge-friendly labeling

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Abstract: In 2009, Kong, Wang, and Lee began work on the problem of finding the edge-balanced index sets (EBI) of complete bipartite graphs K_{m,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(K_{m,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.

Recommendations

• On the edge-balanced index sets of complete even bipartite graphs
• On the edge-balanced index sets of complete bipartite graphs
• On edge-balanced index sets of some complete \(k\)-partite graphs
• 1-edge balance index sets of \(C_n\times P_3\) and \(K_{n,n}\)
• New 2-edge-balanced graphs from bipartite graphs

Cited in

(2)

• On the Edge-Balanced Index Sets of Odd/Even Complete Bipartite Graphs
• On the edge-balanced index sets of complete even bipartite graphs

This page was built for publication: A solution to the edge-balanced index set problem for complete odd bipartite graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3189192)