Degree conditions for restricted-edge-connectivity and isoperimetric-edge-connectivity to be optimal
From MaRDI portal
Publication:864174
DOI10.1016/j.disc.2006.06.028zbMath1177.05067OpenAlexW2054706367MaRDI QIDQ864174
Publication date: 13 February 2007
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2006.06.028
Related Items (26)
Optimally restricted edge connected elementary Harary graphs ⋮ Sufficient Conditions for Maximally k-Isoperimetric Edge Connectivity of Graphs ⋮ Sufficient conditions for triangle-free graphs to be super \(k\)-restricted edge-connected ⋮ On optimizing edge connectivity of product graphs ⋮ \(k\)-restricted edge-connectivity in triangle-free graphs ⋮ Edge fault tolerance of super edge connectivity for three families of interconnection networks ⋮ \(\lambda^{\prime}\)-optimality of bipartite digraphs ⋮ Sufficient conditions for graphs with girth \(g\) to be maximally \(k\)-restricted edge connected ⋮ The \(k\)-restricted edge connectivity of balanced bipartite graphs ⋮ Super \(\lambda_3\)-optimality of regular graphs ⋮ Maximally edge-connected and vertex-connected graphs and digraphs: A survey ⋮ \(k\)-restricted edge connectivity in \((p+1)\)-clique-free graphs ⋮ Cyclic sums, network sharing, and restricted edge cuts in graphs with long cycles ⋮ Sufficient conditions for restricted-edge-connectivity to be optimal ⋮ K-restricted edge connectivity for some interconnection networks ⋮ Edge fault tolerance analysis of super \(k\)-restricted connected networks ⋮ Sufficient conditions for \(\lambda _k\)-optimality in triangle-free graphs ⋮ Sufficient conditions for a graph to be λ k -optimal with given girth and diameter ⋮ Some remarks on \(\lambda _{p,q}\)-connectedness ⋮ Diameter-sufficient conditions for a graph to be super-restricted connected ⋮ Sufficient conditions for super \(k\)-restricted edge connectivity in graphs of diameter 2 ⋮ Degree conditions for graphs to be \(\lambda_3\)-optimal and super-\(\lambda _3\) ⋮ Minimally 3-restricted edge connected graphs ⋮ 3-restricted connectivity of graphs with given girth ⋮ Sufficient conditions for bipartite graphs to be super-\(k\)-restricted edge connected ⋮ The \(k\)-restricted edge connectivity of undirected Kautz graphs
Cites Work
- On computing a conditional edge-connectivity of a graph
- On graphs with equal edge connectivity and minimum degree
- On graphs with equal edge-connectivity and minimum degree
- On a kind of restricted edge connectivity of graphs
- Results on the edge-connectivity of graphs
- Edge-cuts leaving components of order at least three
- Conditional edge connectivity properties, reliability comparisons and transitivity of graphs
- Optimally super-edge-connected transitive graphs
- A proof of an inequality concerning \(k\)-restricted edge connectivity
- On Isoperimetric Connectivity in Vertex-Transitive Graphs
- A Graph-Theoretic Approach to a Communications Problem
- Unnamed Item
- Unnamed Item
This page was built for publication: Degree conditions for restricted-edge-connectivity and isoperimetric-edge-connectivity to be optimal