On computing a conditional edge-connectivity of a graph
Information Processing Letters
Generalized Measures of Fault Tolerance with Application to N-Cube Networks
IEEE Transactions on Computers
Fault Tolerance Measures for m-Ary n-Dimensional Hypercubes Based on Forbidden Faulty Sets
IEEE Transactions on Computers
Conditional Connectivity Measures for Large Multiprocessor Systems
IEEE Transactions on Computers
Generalized Measures of Fault Tolerance in n-Cube Networks
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
On reliability of the folded hypercubes
Information Sciences: an International Journal
Cycles embedding in exchanged hypercubes
Information Processing Letters
The super connectivity of shuffle-cubes
Information Processing Letters
A kind of conditional fault tolerance of (n,k)-star graphs
Information Processing Letters
The super connectivity of exchanged hypercubes
Information Processing Letters
Topological Structure and Analysis of Interconnection Networks
Topological Structure and Analysis of Interconnection Networks
On conditional fault tolerant of dual-cubes
International Journal of Parallel, Emergent and Distributed Systems
The domination number of exchanged hypercubes
Information Processing Letters
| Hi-index | 0.89 |
The exchanged hypercube EH(s,t), proposed by Loh et al. [P.K.K. Loh, W.J. Hsu, Y. Pan, The exchanged hypercube, IEEE Transactions on Parallel and Distributed Systems 16 (9) (2005) 866-874], is obtained by removing edges from a hypercube Q"s"+"t"+"1. This paper considers a kind of generalized measures @k^(^h^) and @l^(^h^) of fault tolerance in EH(s,t) with 1@?s@?t and determines @k^(^h^)(EH(s,t))=@l^(^h^)(EH(s,t))=2^h(s+1-h) for any h with 0@?h@?s. The results show that at least 2^h(s+1-h) vertices (resp. 2^h(s+1-h) edges) of EH(s,t) have to be removed to get a disconnected graph that contains no vertices of degree less than h, and generalizes some known results.