Edge-balanced index sets of five-power-cycle nested graph(m≡0(mod 3))
Zheng Yug · Computer Engineering and Applications Journal · 2015
To cope with the edge-balanced index sets of network graph labeling, on the basis of the equal-cycle nested network graph, a new concept of power-cycle nested network graph is proposed. Moreover, the edge-balanced index sets of five-power-cycle nested network graph are investigated. It reduces the difficulty of five-power-cycle nested network graph labeling because of the novel design of the basic graph, nested-cycle subgraph with gear and five-vertex sector subgraph group. The results show the edge-balanced index sets of five-power-cycle nested network graph when m≡0(mod 3) and m≥4. At the same time, the design methods of the corresponding graphs are also provided.