On the Edge-balanced Index Sets of Complete Bipartite Graphs

Elliot Krop, Keli Sikes

Let $G$ be a graph with vertex set $V(G)$ and edge set $E(G)$, and $f$ be a 0-1 labeling of $E(G)$ so that the absolute difference in the number of edges labeled 1 and 0 is no more…