Fault Hamiltonicity and fault Hamiltonian-connectivity of generalised matching networks
From MaRDI portal
Publication:3645057
DOI10.1080/17445760902774070zbMath1192.68081OpenAlexW2015994769MaRDI QIDQ3645057
Xiaofan Yang, Juan Zhao, Qiang Dong
Publication date: 16 November 2009
Published in: International Journal of Parallel, Emergent and Distributed Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/17445760902774070
interconnection networksHamiltonicityfault-toleranceHamiltonian-connectivitygeneralised matching network
Related Items (2)
Conditional edge-fault-tolerant Hamiltonicity of the data center network ⋮ Embedding Wheel - like Networks
Cites Work
- Ring embedding in faulty pancake graphs
- Minimum neighborhood in a generalized cube
- Locally twisted cubes are 4-pancyclic.
- Hamiltonian properties on the class of hypercube-like networks
- Edge-pancyclicity and path-embeddability of bijective connection graphs
- A lower bound on the size of \(k\)-neighborhood in generalized cubes
- Generalized matching networks and their properties
- A group-theoretic model for symmetric interconnection networks
- The Mobius cubes
- The locally twisted cubes
This page was built for publication: Fault Hamiltonicity and fault Hamiltonian-connectivity of generalised matching networks
