The Edge-Balanced Index Set of Power-Cycle Nested Graph C6m × Pm6

Article Preview

Abstract:

Based on the research of Power-cycle Nested Graph, the decomposition method of single point sector has come up. By the use of the process of clawed nested-cycle graph and nested-cycle sub-graph, the edge-balanced index sets of the power-cycle nested graphare solved whenand. Besides, the constructive proofs of the computational formulas are also completed.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

2128-2131

Citation:

Online since:

September 2013

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] M.C. Kong, Sin-Min Lee, On Edge-Balanced Graphs [J], Graph Theory, Combinatori and c Alorithms, V. 1, 711 -722(1995).

Google Scholar

[2] Harris Kwong and H.K. Ng, On Friendly Index Sets of 2-regular graphs, iscrete Mathematics. 308(2008), 5522-5532.

DOI: 10.1016/j.disc.2007.10.018

Google Scholar

[3] Sin-Min Lee, C.C. Chou, M. Galiardi, M. Kong, D. Perry, H.H. Su, On edge-balance index sets of L-product of cycles with stars, Part 1, JCMCC 78(2011), 195-211.

Google Scholar

[4] Yuge Zheng, Jingjing Yao, The Edge-balance Index Sets of Nested Graph with the Unlimited Pathes and Equal Pathes and Circles (1).

Google Scholar