Sufficient Conditions for Maximally k-Isoperimetric Edge Connectivity of Graphs
From MaRDI portal
Publication:2949723
DOI10.1142/S012905411550032XzbMath1330.68226OpenAlexW1797086798MaRDI QIDQ2949723
Kai Feng, Yubao Guo, Shi-ying Wang
Publication date: 2 October 2015
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s012905411550032x
interconnection networksneighborhoodisoperimetric edge connectivity\(\gamma_k\)-optimalitysuper-\(\gamma_k\)
Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15) Connectivity (05C40)
Cites Work
- Degree conditions for restricted-edge-connectivity and isoperimetric-edge-connectivity to be optimal
- Maximally edge-connected and vertex-connected graphs and digraphs: A survey
- Extra edge connectivity and isoperimetric edge connectivity
- Sufficient conditions for super \(k\)-restricted edge connectivity in graphs of diameter 2
- Superconnectivity of bipartite digraphs and graphs
- On the extraconnectivity of graphs
- Sufficient conditions for a graph to be super restricted edge-connected
- On Isoperimetric Connectivity in Vertex-Transitive Graphs
This page was built for publication: Sufficient Conditions for Maximally k-Isoperimetric Edge Connectivity of Graphs