THE CONNECTIVITY OF EXCHANGED HYPERCUBES
Author:
- 1 June 2010
- journal article
- research article
- Published by World Scientific Pub Co Pte Ltd in Discrete Mathematics, Algorithms and Applications
- Vol. 02 (02) , 213-220
Abstract
The exchanged hypercube EH(s, t), proposed by Loh et al. [The exchanged hypercube, IEEE Trans. Parallel Distri. Syst.16 (2005) 866–874], is obtained by systematically removing links from a binary hypercube Qn. This paper determines that the connectivity and the edge connectivity of EH(s, t) are s + 1 where s ≤ t. That is, for s ≤ t, at least s + 1 vertices (resp. s + 1 edges) of EH(s, t) are removed to get a disconnected graph.Keywords
This publication has 10 references indexed in Scilit:
- Hamiltonian connectivity and globally 3∗-connectivity of dual-cube extensive networksComputers and Electrical Engineering, 2010
- On conditional diagnosability of the folded hypercubes☆Information Sciences, 2008
- Edge-pancyclicity and path-embeddability of bijective connection graphsInformation Sciences, 2008
- On reliability of the folded hypercubesInformation Sciences, 2007
- A Comment on "The Exchanged Hypercube'IEEE Transactions on Parallel and Distributed Systems, 2007
- Edge fault tolerance analysis of a class of interconnection networksApplied Mathematics and Computation, 2006
- Topological Structure and Analysis of Interconnection Networks2001
- On connectivity of the Cartesian product of two graphsApplied Mathematics and Computation, 1999
- Connectivity of kautz networksDiscrete Mathematics, 1993
- Connectivity of circulant digraphsJournal of Graph Theory, 1986