Bipanconnectivity and edge-fault-tolerant bipancyclicity of hypercubes☆
References (12)
- et al.
Edge-pancyclic block-intersection graphs
Discrete Math.
(1991) Pancyclic graphs. I
J. Combin. Theory
(1971)- et al.
Cycles in the cube-connected cycles graph
Discrete Appl. Math.
(1998) The square of a block is vertex pancyclic
J. Combin. Theory Ser. B
(1976)- et al.
Graph Theory with Applications
(1980) - et al.
Embedding of cycles in arrangement graphs
IEEE Trans. Comput.
(1993)
There are more references available in the full text version of this article.
Cited by (112)
Hybrid fault-tolerant prescribed hyper-hamiltonian laceability of hypercubes
2021, Theoretical Computer ScienceCitation Excerpt :When embedding paths and cycles into faulty hypercubes, the faulty nodes and/or edges should be avoided. Thus, the problem of embedding paths and cycles into faulty hypercubes has been proposed and investigated in depth (see for example, [2,4,5,8,9,12,16,17,20,21]). In particular, Sun et al. [20] studied the problem of embedding hamiltonian cycles and hamiltonian paths in hypercubes with faulty edges and/or disjoint adjacent node pairs.
Vertex-pancyclicity of the (n,k)-bubble-sort networks
2021, Theoretical Computer ScienceVertex-disjoint paths joining adjacent vertices in faulty hypercubes
2019, Theoretical Computer ScienceCycles in folded hypercubes with two adjacent faulty vertices
2019, Theoretical Computer ScienceCycles embedding in folded hypercubes under the conditional fault model
2017, Discrete Applied MathematicsConditional fault-tolerant edge-bipancyclicity of hypercubes with faulty vertices and edges
2016, Theoretical Computer Science
- ☆
This work was supported in part by the National Science Council of the Republic of China under Contract NSC 91-2218-E-231-002.
Copyright © 2003 Elsevier Science B.V. All rights reserved.