k-Restricted edge connectivity for some interconnection networks

Applied Mathematics and Computation

Volumn 201, Issue 1-2, 2008, Pages 587-596

  Wang, Shiying ^a   Yuan, Jun ^a   Liu, Aixia ^a  

^a SHANXI UNIVERSITY   (China)

Author keywords

Edge connectivity; k Restricted edge connectivity; Restricted edge connectivity

Indexed keywords

COMPUTATION THEORY; FAULT TOLERANCE; GRAPH THEORY; RELIABILITY ANALYSIS;

EDGE CONNECTIVITY; K-RESTRICTED EDGE CONNECTIVITY; RESTRICTED EDGE CONNECTIVITY;

INTERCONNECTION NETWORKS;

EID: 44649149574     PISSN: 00963003     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.amc.2007.12.055     Document Type: Article

References (18)

1. Bae M.M., and Bose B. Edge disjoint hamiltonian cycles in k-ary n-cubes and hypercubes. IEEE Transactions on Computers 52 10 (2003) 1271-1284
2. Bondy J.A., and Murty U.S.R. Graph Theory with Applications (1980), North Holland, New York
3. Bonsma P., Ueffing N., and Volkmann L. Edge-cuts leaving components of order at least three. Discrete Mathematics 256 (2002) 431-439
4. Chen Y.C., Tan J.J.M., Hsu L.H., and Kao S.S. Super-connectivity and super edge-connectivity for some interconnection networks. Applied Mathematics and Computation 140 (2003) 245-254
5. Chen Y.C., and Tan J.J.M. Restricted connectivity for three families of interconnection networks. Applied Mathematics and Computation 188 (2007) 1848-1855
6. Day K. The conditional node connectivity of the k-ary n-cube. Journal of Interconnection Networks 5 1 (2004) 13-26
7. Fàbrega J., and Fiol M.A. Extraconnectivity of graphs with large girth. Discrete Mathematics 127 (1994) 163-170
8. Godsil C., and Royle G. Algebraic Graph Theory (2001), Springer-Verlag, New York
9. Meng J.X., and Ji Y.H. On a kind of restricted edge connectivity of graphs. Discrete Applied Mathematics 117 (2002) 183-193
10. Ou J.P. Edge cuts leaving components of order at least m. Discrete Mathematics 305 (2005) 365-371
11. J.H. Park, K.Y. Chwa, Recursive circulant: a new topology for multicomputer networks, in: Proceedings International Symposium on Parallel Architectures, Algorithms, and Networks, Kanazawa, Japan, 1994, pp. 73-80.
12. Park J.H., and Chwa K.Y. Recursive circulants and their embeddings among hypercubes. Theoretical Computer Science 244 (2000) 35-62
13. Wang M., and Li Q. Conditional edge connectivity properties, reliability comparison and transitivity of graphs. Discrete Mathematics 258 (2002) 205-214
14. Xu J.M. Topological Structure and Analysis of Interconnection Networks (2001), Kluwer Academic Publishers, London
15. Yang M.C., Tan J.J.M., and Hsu L.H. Hamiltonian circuit and linear array embeddings in faulty k-ary n-cubes. Journal of Parallel and Distributed Computing 67 (2007) 362-368
16. Zhang Z., and Yuan J.J. A proof of an inequality concerning k-restricted edge connectivity. Discrete Mathematics 304 (2005) 128-134
17. Zhang Z., and Yuan J.J. Degree conditions for restricted-edge connectivity and isoperimetric-edge-connectivity to be optimal. Discrete Mathematics 307 (2007) 293-298
18. Zhu Q., Xu J.M., and Lv M. Edge fault tolerance analysis of a class of interconnection networks. Applied Mathematics and Computation 172 (2005) 111-121