On the edge-balanced index sets of product graphs
Combinatorics
2014-02-04 v1
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.
Keywords
Cite
@article{arxiv.1103.4994,
title = {On the edge-balanced index sets of product graphs},
author = {Elliot Krop and Sin-Min Lee and Christopher Raridan},
journal= {arXiv preprint arXiv:1103.4994},
year = {2014}
}
Comments
8 pages