On Edge-Balance Index Sets of a Nested Graph with Infinite Paths and Power Circles

Article Preview

Abstract:

We generalize the concept of edge-balanced labeling to the concept of edge-balance index set of graphs. In this article, we define all class of the nested graph with infinite for the integer and investigate the edge-balance index set of a class graph. In particular, we completely determine the edge-balance index sets of the class graph for the integer and solve formula proof and graphic tectonic methods.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

561-566

Citation:

Online since:

July 2013

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Y. Zheng, J. Lu (2009) Sin-Ming and Wang Ying, 2009, On the perfect index sets of the chain-sum graphs of the first kind of K4-e, 2009 2nd International Conference on Intelligent Computing Technology and Autination, ICICTA 586-589.

DOI: 10.1109/icicta.2009.856

Google Scholar

[2] Y. Zheng and Y. Wang (2012) On the Edge-balance Index Sets of Cn x P2, 2010 International Conference on Networking and Digital Society 360-363.

Google Scholar

[3] Y. Zheng and H. Tian (2012) On the Edge-balance Index Sets of the power circle nested graphs, ASL l7: 534-536.

Google Scholar

[4] Alexander Nien-Tsu Lee, Sin-Min Lee and Ho Kuen Ng (2008) On the balance index set of graph, JCMCC 66: 133-138.

Google Scholar

[5] S. Lee (1995) On Edge-Balanced Graphs Graph Theory, Combinatorial and Algorit-hms 1: 711-722.

Google Scholar

[6] S. Kim, S. Lee and Ho Kuen Ng (2008) On Balancedness of Some Graph Constructions, Journal of Combinatorial Mathematics and Combinatorial Computing 6: 1-6.

Google Scholar