Subgraph fault tolerance of distance optimally edge connected hypercubes and folded hypercubes
Authors:
- Litao GuoLGLitao Guo
- Chengfu QinCQChengfu Qin
- Liqiong XuLXLiqiong Xu
- 1 April 2020
- journal article
- research article
- Published by Elsevier in Journal of Parallel and Distributed Computing
- Vol. 138, 190-198
Abstract
No abstract availableKeywords
Funding Information
- National Natural Science Foundation of China
This publication has 21 references indexed in Scilit:
- Reliability measures in relation to the h-extra edge-connectivity of folded hypercubesTheoretical Computer Science, 2016
- On g-extra connectivity of folded hypercubesTheoretical Computer Science, 2015
- Odd cycles embedding on folded hypercubes with conditional faulty edgesInformation Sciences, 2014
- Fault tolerance of hypercubes and folded hypercubesThe Journal of Supercomputing, 2013
- Conditional matching preclusion setsInformation Sciences, 2009
- On reliability of the folded hypercubesInformation Sciences, 2007
- Hamiltonian-connectivity and strongly Hamiltonian-laceability of folded hypercubesComputers & Mathematics with Applications, 2007
- Efficient algorithms for reliability analysis of distributed computing systemsInformation Sciences, 1999
- The vulnerability of the diameter of folded n-cubesDiscrete Mathematics, 1997
- Properties and performance of folded hypercubesIEEE Transactions on Parallel and Distributed Systems, 1991