Strong Fault-Hamiltonicity for the Crossed Cube and Its Extensions

Fault-Hamiltonicity is an important measure of robustness for interconnection networks. Given a graph G = (V, E). The goal is to ensure that G − F remains Hamiltonian for every F ⊆ V ∪E such that |...

[1]  Saïd Bettayeb,et al.  Multiply-Twisted Hypercube with Five or More Dimensions is not Vertex-Transitive , 1995, Inf. Process. Lett..

[2]  Jung-Heum Park,et al.  Many-to-many two-disjoint path covers in restricted hypercube-like graphs , 2014, Theor. Comput. Sci..

[3]  Shuming Zhou.  The Conditional Diagnosability of Twisted Cubes under the Comparison Model , 2009, 2009 IEEE International Symposium on Parallel and Distributed Processing with Applications.

[4]  Rynson W. H. Lau,et al.  Edge-Pancyclicity of Twisted Cubes , 2005, ISAAC.

[5]  Xiaofan Yang,et al.  Embedding a long fault-free cycle in a crossed cube with more faulty nodes , 2010, Inf. Process. Lett..

[6]  Xiaohua Jia,et al.  Complete path embeddings in crossed cubes , 2006, Inf. Sci..

[7]  Xiaohua Jia,et al.  An efficient fault-tolerant routing algorithm in bijective connection networks with restricted faulty edges , 2011, Theor. Comput. Sci..

[8]  Jimmy J. M. Tan,et al.  Fault-tolerant cycle-embedding of crossed cubes , 2003, Inf. Process. Lett..

[9]  Xiao-yan Zhou,et al.  Duality theorem for weak L-R smash products , 2010 .

[10]  Xiaohua Jia,et al.  Node-pancyclicity and edge-pancyclicity of crossed cubes , 2005, Inf. Process. Lett..

[11]  David J. Evans,et al.  The locally twisted cubes , 2005, Int. J. Comput. Math..

[12]  Jun-Ming Xu,et al.  Paths in Möbius cubes and crossed cubes , 2006, Inf. Process. Lett..

[13]  Xin Liu,et al.  Efficient unicast in bijective connection networks with the restricted faulty node set , 2011, Inf. Sci..

[14]  Jimmy J. M. Tan,et al.  On some super fault-tolerant Hamiltonian graphs , 2004, Appl. Math. Comput..

[15]  Yuan Yan Tang,et al.  Embedding a family of disjoint 3D meshes into a crossed cube , 2008, Inf. Sci..

[16]  Junming Xu,et al.  Edge-Pancyclicity of Crossed Cubes , 2005 .

[17]  Jun-Ming Xu,et al.  Fault-tolerant embedding of paths in crossed cubes , 2008, Theor. Comput. Sci..

[18]  Kemal Efe,et al.  Topological Properties of the Crossed Cube Architecture , 1994, Parallel Comput..

[19]  Eddie Cheng,et al.  Matching preclusion and Conditional Matching preclusion for Crossed Cubes , 2012, Parallel Process. Lett..

[20]  Priyalal Kulasinghe,et al.  Connectivity of the Crossed Cube , 1997, Inf. Process. Lett..

[21]  Pao-Lien Lai,et al.  Constructing the nearly shortest path in crossed cubes , 2009, Inf. Sci..

[22]  Hyeong-Seok Lim,et al.  Many-to-Many Disjoint Path Covers in Hypercube-Like Interconnection Networks with Faulty Elements , 2006, IEEE Trans. Parallel Distributed Syst..

[23]  Jung-Sheng Fu,et al.  Fault-free Hamiltonian cycles in crossed cubes with conditional link faults , 2007, Inf. Sci..

[24]  Pao-Lien Lai,et al.  The two-equal-disjoint path cover problem of Matching Composition Network , 2008, Inf. Process. Lett..

[25]  Yuan Yan Tang,et al.  Embedding meshes/tori in faulty crossed cubes , 2010, Inf. Process. Lett..

[26]  Xiaofan Yang,et al.  On the double-vertex-cycle-connectivity of crossed cubes , 2004, Parallel Algorithms Appl..

[27]  Xiaofan Yang,et al.  Embedding a family of disjoint multi-dimensional meshes into a crossed cube , 2008, Inf. Process. Lett..