On the Edge-Balanced Index Sets of Odd/Even Complete Bipartite Graphs
From MaRDI portal
Publication:5251997
zbMATH Open1312.05119arXiv1405.1673MaRDI QIDQ5251997FDOQ5251997
Authors: Hung Hua, Christopher Raridan
Publication date: 21 May 2015
Abstract: In 2009, Kong, Wang, and Lee began work on the problem of finding the edge-balanced index sets of complete bipartite graphs by solving the cases where , , , , and , and also the case where . 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.
Full work available at URL: https://arxiv.org/abs/1405.1673
Recommendations
- On the edge-balanced index sets of complete even bipartite graphs
- On the edge-balanced index sets of complete bipartite graphs
- A solution to the edge-balanced index set problem for complete odd bipartite graphs
- On edge-balanced index sets of some complete \(k\)-partite graphs
- scientific article; zbMATH DE number 6118044
- On the edge-balance index sets of \(B(n)\)
- A note on the edge-balance index sets for graphs
- On the balance index sets of graphs
- On 1-edge balance index set of some graphs
Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Cited In (6)
This page was built for publication: On the Edge-Balanced Index Sets of Odd/Even Complete Bipartite Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5251997)