Edge fault tolerance of interconnection networks with respect to maximally edge-connectivity
From MaRDI portal
Publication:1755582
DOI10.1016/j.tcs.2018.07.020zbMath1410.68062OpenAlexW2886483334WikidataQ129439367 ScholiaQ129439367MaRDI QIDQ1755582
Shuang Zhao, Gaoxing Sun, Ji Xiang Meng
Publication date: 10 January 2019
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2018.07.020
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 (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Connectivity of the crossed cube
- Vulnerability of super edge-connected networks
- Edge fault tolerance of graphs with respect to super edge connectivity
- Edge fault tolerance of super edge connectivity for three families of interconnection networks
- Maximally edge-connected and vertex-connected graphs and digraphs: A survey
- Extraconnectivity of graphs with large girth
- Super-connectivity and super-edge-connectivity for some interconnection networks
- On the extraconnectivity of graphs
- Restricted connectivity for three families of interconnection networks
- Bounds for the Super Extra Edge Connectivity of Graphs
- The locally twisted cubes
- Hamiltonian-laceability of star graphs
- Longest fault-free paths in star graphs with vertex faults
This page was built for publication: Edge fault tolerance of interconnection networks with respect to maximally edge-connectivity
