Full-edge friendly index sets of fan

Let G be a graph with vertex set V(G) and edge set E(G), the labeling function of the edge f(+): E(G) -> {0,1} is induced by the labeling function of the point f : V (G) -> {0,1}, where v(f) (i) and e(f) (i) denotes the number of vertices and edges labeled i. A vertex labeling f of a graph G is said to be friendly if vertical bar v(f) (1) - v(f) (0)vertical bar <= 1. This article discusses the value range of v(f) (0) value in the case of n being odd and even. The full edge friendly index sets of Fan is given by using the decomposition of graph structure and the method of point labeling interchange.