Main Article Content
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<sub>n</sub> X K<sub>2</sub>. We also prove a lemma that is helpful to determine theedge-balanced index sets of regular graphs.
Keywords
Edge-labeling
partial-coloring
edge-friendly labeling
friendly labeling
cordiality
friendly index set
edge-balanced index set
Article Details
How to Cite
Krop, E., Lee, S.-M., & Raridan, C. (2012). ON THE EDGE-BALANCED INDEX SETS OF PRODUCT GRAPHS. Journal of the Indonesian Mathematical Society, 71–78. https://doi.org/10.22342/jims.0.0.20.71-78
