Generalized matching networks and their properties

DOI10.1080/17445760601139039zbMath1115.68025OpenAlexW2052043603MaRDI QIDQ3439859

Jianqiu Cao, Graham M. Megson, Xiaofan Yang, Xiaofeng Liao

Publication date: 18 May 2007

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/17445760601139039

zbMATH Keywords

connectivityinterconnection networkHamiltonian connectednessgeneralized matching networkrecursive generalized matching network

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Related Items (3)

The conditional fault diagnosability of \((n, k)\)-star graphs ⋮ Fault diagnosability of arrangement graphs ⋮ Fault Hamiltonicity and fault Hamiltonian-connectivity of generalised matching networks

Cites Work

• Unnamed Item
• The hamiltonicity of swapped (OTIS) networks built of Hamiltonian component networks
• Super-connectivity and super-edge-connectivity for some interconnection networks
• Locally twisted cubes are 4-pancyclic.
• Hamiltonian properties on the class of hypercube-like networks
• A lower bound on the size of \(k\)-neighborhood in generalized cubes
• Swapped interconnection networks: Topological, performance, and robustness attributes
• A group-theoretic model for symmetric interconnection networks
• The Mobius cubes
• The locally twisted cubes

This page was built for publication: Generalized matching networks and their properties