On the Edge-Balance Index Sets of the Net Graph Cn2×P2n(n=0(mod2))

Yu Ge Zheng; Yan Ming Chang

doi:10.4028/www.scientific.net/AMR.314-316.2556

Paper Titles

Processing Effect of Injection Molded Nanoparticle/Polymer Composites on their Resistivity
p.2531

Modeling and Analysis of End of Life Vehicles Recovery: an Enhanced IDEF0 Methodology (Part I)
p.2539

Modeling and Analysis of End of Life Vehicles Recovery: An Enhanced IDEF0 Methodology (Part II)
p.2543

Development of Acoustic System of Hexahedral Sapphire Abrasive Shock Machining
p.2547

Error Analysis and Control of Standard Mast Section Used in Mast-Climbing Work Platform
p.2552

On the Edge-Balance Index Sets of the Net Graph C_n²×P_{2_n}(n=0(mod2))
p.2556

Flow Stress Behavior of the Normalized and Tempered as-Cast 42CrMo Steel during Hot Deformation
p.2560

Tribo-Electrochemical Performance of Copper ECMP in Mixed Phosphate Electrolyte
p.2565

Interval Analysis Method of Fault Tree Based on Convex Model
p.2569

HomeAdvanced Materials ResearchAdvanced Materials Research Vols. 314-316On the Edge-Balance Index Sets of the Net Graph...

On the Edge-Balance Index Sets of the Net Graph C_n²×P_{2_n}(n=0(mod2))

Abstract:

In this paper, we mainly use the methods and techniques of graph theory and combinatorial mathematics to research the largest edge-balance index of the graph Cn2*P2n(n=0(mod2)), the edge-balance index sets of the graph are discussed, and finally getting the constructive proof about all the edge-balance index sets of Cn2*P2n(n=0(mod2))

You might also be interested in these eBooks

Advanced Manufacturing Technology, ADME 2011

View Preview

Info:

Periodical:

Advanced Materials Research (Volumes 314-316)

Pages:

2556-2559

DOI:

https://doi.org/10.4028/www.scientific.net/AMR.314-316.2556

Citation:

Cite this paper

Online since:

August 2011

Authors:

Yu Ge Zheng, Yan Ming Chang

Keywords:

Edge-Balance Index Set, Edge-Friendly Labeling, Graph C_N²× P₂_N

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] Zheng Yuge, Lu Juan, Lee Sin-Ming and Wang Ying: On the Perfect Index Set of the Chain-sum Graphs of the First Kind of K4-e,2009 2nd International Conference on Intelligent Computing Technology and Autination,icicta2009,v4, p.586.

DOI: 10.1109/icicta.2009.856

Google Scholar

[2] Zheng Yuge, Wang Ying: On the Edge-Balance Index Sets of, 2010 International Conference on Net-working and Digital Society, ICNDS 2010, v2, p.360.

Google Scholar

[3] Ebrahim Salehi and Sin-Min Lee: Friendly Index Sets of Trees, Congressus Numerantium 178(2006), p.173.

Google Scholar

[4] Alexander Nien-Tsu Lee, Sin-Min Lee and Ho Kuen Ng: On the Balance Index Set of Graphs, Journal of Combinatorial Mathematics and Combinatorial Computing, 66(2008), p.133.

Google Scholar

[5] Man Kong and Sin-Min Lee: On Edge-Balanced Graghs, Graph Theory, Combinatoric and Algorithms,1(1995), p.711.

Google Scholar

[6] Suh-Ryung Kim, Sin-Min Lee and Ho Kuen Ng: On Balancedness of Some Graph Constructions, Journal of Combinational Mathematics and Combinatorial Computing, 66(2008), p.3.

Google Scholar

[7] B.L. Chen, K.C. Huang and Shi-Shen Liu: On Edge-Balanced, Journal of Combinatorial Mathematics and Combinatorial Computing, 42(2002), p.177.

Google Scholar