On the edge-balanced index sets of product graphs
Elliot Krop, Sin-Min Lee, Christopher Raridan
TL;DR
This paper characterizes strongly edge regular product graphs and determines the edge-balanced index sets for specific bipartite and regular graphs, providing new insights into graph edge properties.
Contribution
It introduces a characterization of strongly edge regular product graphs and computes edge-balanced index sets for certain bipartite and regular graphs, including $K_n imes K_2$.
Findings
Characterization of strongly edge regular product graphs.
Determination of edge-balanced index sets for $K_{m,n}$ without perfect matching.
A helpful lemma for analyzing edge-balanced index sets of regular graphs.
Abstract
We characterize strongly edge regular product graphs and find the edge-balanced index sets of complete bipartite graphs without a perfect matching, the direct product . We also prove a lemma that is helpful to determine the edge-balanced index sets of regular graphs.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Graph Labeling and Dimension Problems · Graph theory and applications