Skip to main content
Article thumbnail
Location of Repository

Bipancyclicity in k-ary n-cubes with faulty edges under a conditional fault assumption.

By Y. Xiang and I.A. Stewart


We prove that a k-ary 2-cube Q^k_2 with 3 faulty edges but where every vertex is incident with at least 2 healthy edges is bipancyclic, if k \geq 3, and k-pancyclic, if k \geq 5 is odd (these results are optimal). We go on to show that when k \geq 4 is even and n \geq 3, any k-ary n-cube Q^k_n with at most 4n − 5 faulty edges so that every vertex is incident with at least 2 healthy edges is bipancyclic, and that this result is optimal

Topics: Interconnection networks. k-ary n-cubes. Fault-tolerance. Bipancyclicity.
Publisher: IEEE Computer Society
Year: 2011
DOI identifier: 10.1109/TPDS.2011.22
OAI identifier:

Suggested articles


  1. (2005). A technology-aware and energy-oriented topology exploration for on-chip networks,
  2. (2009). Bipanconnectivity and bipancyclicity in k-ary n-cubes, doi
  3. (2009). Conditional edge-fault Hamiltonicity of matching composition networks,
  4. (2007). Conditional edge-fault-tolerant Hamiltonian cycle embedding of star graphs,
  5. (2007). Conditional fault-tolerant Hamiltonicity of star graphs,
  6. (2007). Distributed algorithms for building Hamiltonian cycles in k-ary ncubes and hypercubes with faulty links, doi
  7. (2010). Edge-fault-tolerant Hamiltonicity of locally twisted cubes under conditional edge faults,
  8. (2009). Embedding Hamiltonian cycles in alternating group graphs under conditional fault model, doi
  9. (2007). Fault-free Hamiltonian cycles in crossed cubes with conditional link faults,
  10. (2008). Fault-free Hamiltonian cycles in twisted cubes with conditional link faults,
  11. (2005). Hamiltonian-like properties of kary n-cubes,
  12. (2004). Linear array and ring embeddings in conditional faulty hypercubes, doi
  13. (2007). Panconnectivity and edge-pancyclicity of 3-ary n-cubes,
  14. (2010). Pancyclicity of Hamiltonian and highly connected graphs,
  15. (1990). Performance analysis of k-ary n-cube interconnection networks,
  16. (1952). Some theorems on abstract graphs,
  17. (1996). The Chva´tal–Erdo¨s condition for cycles in triangle-free graphs,
  18. (1996). The Cray T3E network: adaptive routing in a high performance 3D torus,

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.