On reliability of the folded hypercubes
- 8 December 2006
- journal article
- Published by Elsevier BV in Information Sciences
- Vol. 177 (8), 1782-1788
- https://doi.org/10.1016/j.ins.2006.11.003
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- Super Connectivity of Line Graphs and DigraphsActa Mathematicae Applicatae Sinica, English Series, 2006
- Cycles in folded hypercubesApplied Mathematics Letters, 2005
- Super connectivity of line graphsInformation Processing Letters, 2005
- Sufficient conditions for graphs to be λ′‐optimal, super‐edge‐connected, and maximally edge‐connectedJournal of Graph Theory, 2005
- Constructing one-to-many disjoint paths in folded hypercubesIEEE Transactions on Computers, 2002
- The vulnerability of the diameter of folded n-cubesDiscrete Mathematics, 1997
- Algorithms and properties of a new two-level network with folded hypercubes as basic modulesIEEE Transactions on Parallel and Distributed Systems, 1995
- Extraconnectivity of graphs with large girthDiscrete Mathematics, 1994
- Properties and performance of folded hypercubesIEEE Transactions on Parallel and Distributed Systems, 1991
- On computing a conditional edge-connectivity of a graphInformation Processing Letters, 1988