Hamiltonian cycles passing through linear forests in k-ary n-cubes

No abstract is available for this paper.

• Publication year

  2011

• Venue

  Discrete Applied Mathematics

• Publication date

  2011-08-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1016/j.dam.2011.05.008
• 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 embeddings in faulty 3-ary n-cubes

  2010cited by this paper
• Embedding paths and cycles in 3-ary n-cubes with faulty nodes and links

  2010cited by this paper
• Bipanconnectivity and Bipancyclicity in k-ary n-cubes

  2009cited by this paper
• Cycle and Path Embedding on 5-ary N-cubes

  2009cited by this paper
• Fault-free cycles passing through prescribed paths in hypercubes with faulty edges

  2009cited by this paper
• Panconnectivity and edge‐pancyclicity of k‐ary n‐cubes

  2009cited by this paper
• Strongly Hamiltonian laceability of the even k-ary n-cube

  2009cited by this paper
• Graph Theory

  2008cited by this paper
• All-to-all disjoint multipath routing using cycle embedding

  2008cited by this paper
• A fault-free Hamiltonian cycle passing through prescribed edges in a hypercube with faulty edges

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

  2007cited by this paper
• Hamiltonian paths with prescribed edges in hypercubes

  2007cited by this paper
• Hamiltonian circuit and linear array embeddings in faulty k-ary n-cubes

  2007cited by this paper
• Embedding cycles and paths in a k-ary n-cube

  2007cited by this paper
• Hamiltonian cycles and paths with a prescribed set of edges in hypercubes and dense sets

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

  2005cited by this paper
• Blue Gene/L torus interconnection network

  2005cited by this paper
• On k-ary n-cubes: Theory and Applications

  2003cited by this paper
• Fault-Tolerant Embeddings of Hamiltonian Circuits in k-ary n-Cubes

  2002cited by this paper
• The k-ary n-cube network : modeling, topological properties and routing strategies

  1999cited by this paper
• Performance of the CRAY T3E Multiprocessor

  1997cited by this paper
• Lee Distance and Topological Properties of k-ary n-cubes

  1995cited by this paper
• Cray T3D: a new dimension for Cray Research

  1993cited by this paper
• On the Existence of Hamiltonian Circuits in Faulty Hypercubes

  1991cited by this paper
• iWarp: a 100-MOPS, LIW microprocessor for multicomputers

  1991cited by this paper
• Performance Analysis of k-Ary n-Cube Interconnection Networks

  1987cited by this paper

• Embedding Hamiltonian Paths with Prescribed Linear Forests into k-ary n-Cube Networks

  2024cites this paper
• Hamiltonian paths and Hamiltonian cycles passing through prescribed linear forests in star graph with fault-tolerant edges

  2023cites this paper
• Hamiltonian paths of k-ary n-cubes avoiding faulty links and passing through prescribed linear forests

  2021influential citation
• Prescribed Hamiltonian Connectedness of 2D Torus

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

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

  2019cites this paper
• Hamiltonian paths and cycles pass through prescribed edges in the balanced hypercubes

  2019cites this paper
• A type of perfect matchings extend to hamiltonian cycles in k-ary n-cubes

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

  2017cites this paper
• Paired 2-disjoint path covers of multidimensional torus networks with faulty edges

  2016cites this paper
• Paired 2-disjoint path covers of faulty k-ary n-cubes

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

  2016cites this paper
• Hamiltonian Cycle and Path Embeddings in k-Ary n-Cubes Based on Structure Faults

  2016cites this paper
• Unchanging the diameter of k-ary n-cube networks with faulty vertices

  2015cites this paper
• Matchings extend to Hamiltonian cycles in k-ary n-cubes

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

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

  2013cites this paper
• Disjoint cycles in hypercubes with prescribed vertices in each cycle

  2013cites this paper