Based on the study of the edge-balance index sets of Cn×P3，Cn×P11, this paper introduced several novel techniques of combinatorial design which generalized the effective classification of all natural numbers m and n. These ideas help to examine the problem of the edge-balance index sets of the nested graph Cn×Pm with unlimited paths and equal circles，obtaining the computational formula of the edge-balance index sets Cn×Pm(n≥3,m≡0(mod3)), and presenting the way to design the graphs.