Edge cuts leaving components of order at least \(m\)
From MaRDI portal
Publication:2581431
DOI10.1016/j.disc.2005.10.012zbMath1078.05052OpenAlexW2129469833MaRDI QIDQ2581431
Publication date: 10 January 2006
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2005.10.012
Related Items (41)
Sufficient conditions for \(k\)-restricted edge connected graphs ⋮ On edge cut of graphs leaving components of order at least five ⋮ A bound on 4-restricted edge connectivity of graphs ⋮ Sufficient conditions for optimally and super m-restricted edge-connected graphs with given girth ⋮ Bounds for the Super Extra Edge Connectivity of Graphs ⋮ On the super‐restricted arc‐connectivity of s ‐geodetic digraphs ⋮ On the restricted arc-connectivity of \(s\)-geodetic digraphs ⋮ On maximal 3-restricted edge connectivity and reliability analysis of hypercube networks ⋮ Optimally restricted edge connected elementary Harary graphs ⋮ Sufficient conditions for triangle-free graphs to be super \(k\)-restricted edge-connected ⋮ Edge fault tolerance of graphs with respect to super edge connectivity ⋮ Sufficient conditions for maximally restricted edge connected graphs ⋮ The edge connectivity of expanded \(k\)-ary \(n\)-cubes ⋮ The \(k\)-restricted edge connectivity of balanced bipartite graphs ⋮ Super \(\lambda_3\)-optimality of regular graphs ⋮ Super \(s\)-restricted edge-connectivity of vertex-transitive graphs ⋮ Maximally edge-connected and vertex-connected graphs and digraphs: A survey ⋮ Diameter-girth sufficient conditions for optimal extraconnectivity in graphs ⋮ Cyclic sums, network sharing, and restricted edge cuts in graphs with long cycles ⋮ K-restricted edge connectivity for some interconnection networks ⋮ On the reliability of modified bubble-sort graphs ⋮ Edge fault tolerance analysis of super \(k\)-restricted connected networks ⋮ Sufficient conditions for \(\lambda _k\)-optimality in triangle-free graphs ⋮ Measuring instance difficulty for combinatorial optimization problems ⋮ Vulnerability of super extra edge-connected graphs ⋮ Some results about the reliability of folded hypercubes ⋮ Sufficient conditions for a graph to be λ k -optimal with given girth and diameter ⋮ Some remarks on \(\lambda _{p,q}\)-connectedness ⋮ On 3-restricted edge connectivity of undirected binary Kautz graphs ⋮ Sufficient conditions for super \(k\)-restricted edge connectivity in graphs of diameter 2 ⋮ Unnamed Item ⋮ Reliability analysis of godan graphs ⋮ On the existence of edge cuts leaving several large components ⋮ Degree conditions for graphs to be \(\lambda_3\)-optimal and super-\(\lambda _3\) ⋮ On the 3-restricted edge connectivity of permutation graphs ⋮ Minimally 3-restricted edge connected graphs ⋮ A neighborhood condition for graphs to be maximally \(k\)-restricted edge connected ⋮ 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 ⋮ Onm-restricted edge connectivity of undirected generalized De Bruijn graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 3-restricted edge cut of graphs
- On computing a conditional edge-connectivity of a graph
- Cuts leaving components of given minimum order
- Edge-cuts leaving components of order at least three
- Conditional edge connectivity properties, reliability comparisons and transitivity of graphs
- The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
- Combinatorial optimization problems in the analysis and design of probabilistic networks
- Some Theorems on Abstract Graphs
- On restricted edge-connectivity of graphs.
This page was built for publication: Edge cuts leaving components of order at least \(m\)
