Abstract. Let G = (V, E) be a simple graph. An edge labeling f : E → {0, 1} induces a vertex labeling f is called the edge-friendly index of G under an edge-friendly labeling f . The full edge-friendly index set of a graph G is the set of all possible edge-friendly indices of G. Full edge-friendly index sets of complete bipartite graphs will be determined
