On the edge-balanced index sets of product 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 Kn× K2. We also prove a lemma that is helpful to determine the edge-balanced index sets of regular graphs.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.