ON THE EDGE-BALANCED INDEX SETS OF PRODUCT GRAPHS
Abstract: We characterize
strongly edge regular product graphs and find the edgebalanced 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.
Key words: Edge-labeling,
partial-coloring, edge-friendly labeling, friendly labeling, cordiality,
friendly index set, edge-balanced index set
Author: Elliot Krop, Sin-Min
Lee, Christopher Raridan
Journal Code: jpmatematikagg110024
