Bipanconnectivity and edge-fault-tolerant bipancyclicity of hypercubes

Information Processing Letters

Volumn 87, Issue 2, 2003, Pages 107-110

  Li, Tseng Kuei ^a   Tsai, Chang Hsiung ^a   Tan, Jimmy J M ^b   Hsu, Lih Hsing ^b  

^a CHING YUN UNIVERSITY   (Taiwan)

^b NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

Author keywords

Bipanconnected; Bipancyclic; Hamiltonian; Hypercube; Interconnection networks

Indexed keywords

COMPUTER NETWORKS; FAULT TOLERANT COMPUTER SYSTEMS; HAMILTONIANS; INTERCONNECTION NETWORKS;

BIPANCYCLICITY;

TOPOLOGY;

EID: 0038517063     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(03)00258-8     Document Type: Article

References (12)

1. Alspach B., Hare D. Edge-pancyclic block-intersection graphs. Discrete Math. 97:(1-3):1991;17-24.
2. Bondy J.A. Pancyclic graphs. I. J. Combin. Theory. 11:1971;80-84.
3. Bondy J.A., Murty U.S.R. Graph Theory with Applications. 1980;North-Holland, New York.
4. Day K., Tripathi A. Embedding of cycles in arrangement graphs. IEEE Trans. Comput. 12:1993;1002-1006.
5. Germa A., Heydemann M.C., Sotteau D. Cycles in the cube-connected cycles graph. Discrete Appl. Math. 83:1998;135-155.
6. Hobbs A. The square of a block is vertex pancyclic. J. Combin. Theory Ser. B. 20:(1):1976;1-4.
7. Hwang S.C., Chen G.H. Cycles in butterfly graphs. Networks. 35:(2):2000;161-171.
8. Latifi S., Zheng S., Bagherzadeh N. Optimal ring embedding in hypercubes with faulty links. Fault-Tolerant Computing Symp. 1992;178-184.
9. Leighton F.T. Introduction to Parallel Algorithms and Architecture: Arrays, Trees, Hypercubes. 1992;Morgan Kaufmann, San Mateo, CA.
10. Mitchem J., Schmeichel E. Pancyclic and bipancyclic graphs - a survey. Proc. First Colorado Symp. on Graphs and Applications, Boulder, CO. 1985;271-278 Wiley-Interscience, New York.
11. Saad Y., Schultz M.H. Topological properties of hypercubes. IEEE Trans. Comput. 37:(7):1988;867-872.
12. Song Z.M., Qin Y.S. A new sufficient condition for panconnected graphs. Ars Combin. 34:1992;161-166.