Fault-free cycles passing through prescribed paths in hypercubes with faulty edges

No abstract is available for this paper.

• Publication year

  2009

• Venue

  Applied Mathematics Letters

• Publication date

  2009-06-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1016/j.aml.2008.08.021
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Path bipancyclicity of hypercubes

  2007cited by this paper
• Conditional edge-fault-tolerant edge-bipancyclicity of hypercubes

  2007cited by this paper
• Cycles passing through prescribed edges in a hypercube with some faulty edges

  2007cited by this paper
• Edge-fault-tolerant edge-bipancyclicity of hypercubes

  2005cited by this paper
• Hamiltonian Cycles with Prescribed Edges in Hypercubes

  2005cited by this paper
• Bipanconnectivity and edge-fault-tolerant bipancyclicity of hypercubes

  2003cited by this paper
• Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes

  1991cited by this paper
• Hypercube supercomputers

  1989cited by this paper
• Topological properties of hypercubes

  1988cited by this paper

• Construction of cycles with various lengths in dual cube extensive networks

  2024cites this paper
• Fault-free Hamiltonian cycle including given edges in folded hypercubes with faulty edges

  2020cites this paper
• Hamiltonian paths passing through prescribed edges in balanced hypercubes

  2019cites this paper
• Matchings extend to Hamiltonian cycles in hypercubes with faulty edges

  2019cites this paper
• Embedding fault-free hamiltonian paths with prescribed linear forests into faulty ternary n-cubes

  2019cites this paper
• Embedding various cycles with prescribed paths into k-ary n-cubes

  2017cites this paper
• Hamiltonicity of hypercubes with faulty vertices

  2016cites this paper
• Hamiltonian Cycle and Path Embeddings in 3-Ary 3-Cubes Based on K1,3 Structure Faults

  2016cites this paper
• Fault-Free Hamiltonian Cycles Passing through Prescribed Edges in k-Ary n-Cubes with Faulty Edges

  2015cites this paper
• Panconnectivity and pancyclicity of the 3-ary n-cube network under the path restrictions

  2014cites this paper
• Fault tolerance for hypercube networks via independent spanning trees

  2014cites this paper
• Fault-free Hamiltonian cycles passing through a prescribed linear forest in 3-ary n-cube with faulty edges

  2014cites this paper
• Fault-free Hamiltonian cycles passing through a linear forest in ternary nn-cubes with faulty edges

  2013cites this paper
• Edge-fault-tolerant panconnectivity and edge-pancyclicity of the complete graph

  2013cites this paper
• The 2-path-bipanconnectivity of hypercubes

  2013cites this paper
• Fault-free Hamiltonian cycles passing through a prescribed linear forest in 3-ary n-cube with faulty edges

  2013cites this paper
• An algorithm to construct independent spanning trees on parity cubes

  2012cites this paper
• Paired many-to-many disjoint path covers of hypercubes with faulty edges

  2012cites this paper
• Hamiltonian paths and cycles with prescribed edges in the 3-ary n-cube

  2011cites this paper
• Hamiltonian cycles passing through linear forests in k-ary n-cubes

  2011cites this paper
• Matchings Extend to Perfect Matchings on Hypercube Networks

  2010cites this paper
• Edge-fault-tolerant diameter and bipanconnectivity of hypercubes

  2010cites this paper
• Cycles passing through a prescribed path in a hypercube with faulty edges

  2010cites this paper