On the basis of power-cycle nested network graph, the edge-balanced index sets of circle union graph F(3,n) graph were investigated. A new method of changing index is provided, simplifying the proving process. It reduced the difficulty of circle union graph F(3,n) graph labeling because of the novel design of the basic graph and single-point sector subgraph. The results show that the edge-balanced index sets of circle union graph F(3,n) graph. This paper has proved the existence of the edge-balanced index sets of one class of circle union graph, the computational formulas and the construction of the corresponding graphs are also provided.

Based on the power-cycle nested graph brought before, using the research methods and techniques of graph theory and combinatorial mathematics, through studying the new design idea about the basic graph,nested-cycle subgraph with gear and five-vertex sector subgraph-group, the edge-balanced index sets of the power-cycle nested graph are provided here, for and , and the proofs of the computational of formulas and the construction of the corresponding graphs also give out.