A neighborhood condition for graphs to be maximally \(k\)-restricted edge connected
From MaRDI portal
Publication:763501
DOI10.1016/J.IPL.2011.10.012zbMath1232.05118OpenAlexW2013889573MaRDI QIDQ763501
Lei Zhang, Shi-ying Wang, Shang-Wei Lin
Publication date: 9 March 2012
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2011.10.012
Related Items (7)
A sufficient condition for graphs to be super \(k\)-restricted edge connected ⋮ Sufficient conditions for \(k\)-restricted edge connected graphs ⋮ A neigborhood union condition for nonadjacent vertices in graphs ⋮ A sufficient condition for graphs to be \(\lambda_k\)-optimal ⋮ Sufficient conditions for graphs with girth \(g\) to be maximally \(k\)-restricted edge connected ⋮ Unnamed Item ⋮ Degree conditions for graphs to be maximally \(k\)-restricted edge connected and super \(k\)-restricted edge connected
Cites Work
- Unnamed Item
- On the restricted connectivity and superconnectivity in graphs with given girth
- Maximally edge-connected and vertex-connected graphs and digraphs: A survey
- Sufficient conditions for super \(k\)-restricted edge connectivity in graphs of diameter 2
- On computing a conditional edge-connectivity of a graph
- Superconnectivity of bipartite digraphs and graphs
- Extraconnectivity of graphs with large girth
- Sufficient conditions for \(\lambda'\)-optimality in graphs of diameter 2
- Edge-cuts leaving components of order at least three
- Optimally super-edge-connected transitive graphs
- \(\lambda ^{\prime}\)-optimally connected mixed Cayley graphs
- A proof of an inequality concerning \(k\)-restricted edge connectivity
- Edge cuts leaving components of order at least \(m\)
- On restricted connectivities of permutation graphs
- Sufficient conditions for λ′‐optimality in graphs with girth g
This page was built for publication: A neighborhood condition for graphs to be maximally \(k\)-restricted edge connected
