The pancyclicity and the Hamiltonian-connectivity of the generalized base-b hypercube

No abstract is available for this paper.

• Publication year

  2008

• Venue

  Computers & electrical engineering

• Publication date

  2008-07-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1016/j.compeleceng.2007.05.011
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Optimal Embeddings of Paths with Various Lengths in Twisted Cubes

  2007cited by this paper
• Optimal fault-tolerant embedding of paths in twisted cubes

  2007cited by this paper
• Complete path embeddings in crossed cubes

  2006cited by this paper
• Edge-Pancyclicity of Twisted Cubes

  2005cited by this paper
• Hamiltonian properties on the class of hypercube-like networks

  2004cited by this paper
• Minimum k-geodetically connected digraphs

  2004cited by this paper
• Pancyclicity of recursive circulant graphs

  2002cited by this paper
• Evaluating the communications capabilities of the generalized hypercube interconnection network

  1999cited by this paper
• Highly Fault-Tolerant Routings and Fault-Induced Diameter for Generalized Hypercube Graphs

  1997cited by this paper
• Embedding Cycles in IEH Graphs

  1997cited by this paper
• Optimal Communication Primitives on the Generalized Hypercube Network

  1996cited by this paper
• Resource placement in torus-based networks

  1996cited by this paper
• Embedding Graphs onto the Supercube

  1995cited by this paper
• Efficient Resource Placement in Hypercubes Using Multiple-Adjacency Codes

  1994cited by this paper
• On balancing sorting on a linear array

  1993cited by this paper
• Applied and algorithmic graph theory

  1992cited by this paper
• Uniform Approach for Solving some Classical Problems on a Linear Array

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

  1991cited by this paper
• A new hierarchy of hypercube interconnection schemes for parallel computers

  1988cited by this paper

• Fault-tolerant Hamiltonian cycle strategy for fast node fault diagnosis based on PMC in data center networks.

  2024cites this paper
• The Weakly Dimension-Balanced Pancyclicity on Toroidal Mesh Graph Tm, n When Both m and n Are Odd

  2021cites this paper
• Finding Hamiltonian and Longest (s, t)-paths of C-shaped Supergrid Graphs in Linear Time

  2019cites this paper
• The Weakly Dimension-Balanced Pancyclic on Tm , n for m or n Being Even and the Other Being Odd

  2019cites this paper
• The Hamiltonian Connectivity of Alphabet Supergrid Graphs

  2019cites this paper
• The influence of datacenter usage on symmetry in datacenter network design

  2018cites this paper
• 广义b-基超立方体网络的控制数 Domination Numbers for Generalized Base-b Hypercube Networks

  2017cites this paper
• The Hamiltonian connectivity of rectangular supergrid graphs

  2016cites this paper
• Geodesic pancyclicity and balanced pancyclicity of the generalized base-b hypercube

  2012cites this paper
• Parallel construction of optimal independent spanning trees on Cartesian product of complete graphs

  2011cites this paper
• The panconnectivity and the pancycle-connectivity of the generalized base-b hypercube

  2009cites this paper
• Complete k-ary trees and Hamming graphs

  2009cites this paper
• Computers and Mathematics with Applications Vertex-bipancyclicity of the Generalized Honeycomb Tori

  year unknowncites this paper