Cycles embedding in hypercubes with node failures☆
References (10)
Fault-tolerant cycle embedding in the hypercube
Parallel Comput.
(2003)Fault-tolerant cycle embedding in the hypercube with both faulty vertices and faulty edges
Parallel Comput.
(2006)- et al.
Bipanconnectivity and edge-fault-tolerant bipancyclicity of hypercubes
Inform. Process. Lett.
(2003) Linear arrays and rings embedding in conditional faulty hypercubes
Theoret. Comput. Sci.
(2004)- et al.
Edge-fault-tolerant edge-bipancyclicity of hypercubes
Inform. Process. Lett.
(2005)
Cited by (27)
Vertex-disjoint paths joining adjacent vertices in faulty hypercubes
2019, Theoretical Computer ScienceConditional fault-tolerant edge-bipancyclicity of hypercubes with faulty vertices and edges
2016, Theoretical Computer ScienceHamiltonicity of hypercubes with faulty vertices
2016, Information Processing LettersCitation Excerpt :There is a large amount of literature on cycle and/or path embedding into interconnection networks with or without faulty elements, see a survey [22] and references therein. For (fault-tolerant) path or cycle embedding of hypercubes, also see references [2–14,17–21]. In 2001, Locke [15] considered Hamiltonicity of hypercubes with faulty vertices and proposed the following conjecture that remains open.
Fault-tolerant edge-bipancyclicity of faulty hypercubes under the conditional-fault model
2016, Information SciencesCitation Excerpt :Here, Qn can have only faulty vertices, only faulty edges or both faulty vertices and faulty edges. There is also an interesting fault-tolerant cycle embedding problem which is the fault-tolerant edge-bipancyclicity of hypercubes [13,18,22–26,30,31]. As a comparative viewpoint, for the fault-tolerant vertex-bipancyclicity of hypercubes, one may refer to [23,32].
Odd cycles embedding on folded hypercubes with conditional faulty edges
2014, Information SciencesFault-tolerant cycle embedding in the faulty hypercubes
2013, Information SciencesCitation Excerpt :Most of the works on graph embedding take paths, cycles, trees, meshes as guest graphs [12,13,21,22], because these interconnection networks are widely used in parallel computing systems. It is important to have efficient ring embedding in a network, since some parallel applications are originally designated on a ring or Torus architecture such as those in image and signal processing [16]. The cycle-embedding problem deals with all possible lengths of the cycles in a given graph.
- ☆
This work was supported in part by the National Science Council of the Republic of China under Contract NSC 95-2221-E-026-002.