On the edge-balanced index sets of product graphs
classification
🧮 math.CO
keywords
graphsedge-balancedindexproductsetsregularbipartitecharacterize
read the original 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 $K_n\times K_2$. We also prove a lemma that is helpful to determine the edge-balanced index sets of regular graphs.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.