Extraconnectivity of \(k\)-ary \(n\)-cube networks
DOI10.1016/j.tcs.2012.03.030zbMath1246.68172OpenAlexW159485782MaRDI QIDQ442246
Sun-Yuan Hsieh, Ying-Hsuan Chang
Publication date: 10 August 2012
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.03.030
connectivityfault tolerancemultiprocessor systemsextraconnectivitygraph-theoretic interconnection networks\(k\)-ary \(n\)-cube networks
Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15) Connectivity (05C40)
Related Items (68)
Cites Work
- Unnamed Item
- Unnamed Item
- K-restricted edge connectivity for some interconnection networks
- Extraconnectivity of graphs with large girth
- On the extraconnectivity of graphs
- Fault-tolerant analysis of a class of networks
- Panconnectivity and edge-pancyclicity ofk-aryn-cubes
- Lee distance and topological properties of k-ary n-cubes
This page was built for publication: Extraconnectivity of \(k\)-ary \(n\)-cube networks