On the Edge-balanced Index Set of a class of Power-cycle Nested Network Graph

Based on the research of Power-cycle Nested Graph C6mxpm6, the decomposition method of single point sector has come up. By the use of the process of clawed nested-cycle sub-graph, the edge-balanced index sets of the power-cycle nested graph C6mxpm6 are solved when m ≥4 and m=4(mod5) . Besides, the constructive proofs of the computational formulas are also completed. The theory can be applied to information engineering, communication networks, computer science, economic management, medicine, etc. The proving method can be a reference to solve the problem of the power-cycle nested graph C6mxpm6.