Super restricted edge connectivity of regular graphs
From MaRDI portal
Publication:2494101
DOI10.1007/s00373-005-0600-9zbMath1089.05039OpenAlexW2088914048MaRDI QIDQ2494101
Publication date: 16 June 2006
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-005-0600-9
Related Items
On restricted edge-connectivity of lexicographic product graphs ⋮ A characterization of graphs by codes from their incidence matrices ⋮ On optimizing edge connectivity of product graphs ⋮ Super restricted edge connectivity of regular edge-transitive graphs ⋮ On restricted edge-connectivity of replacement product graphs ⋮ Sufficient conditions for maximally restricted edge connected graphs ⋮ Maximally edge-connected and vertex-connected graphs and digraphs: A survey ⋮ Super restricted edge connected Cartesian product graphs ⋮ Super \(p\)-restricted edge connectivity of line graphs
Cites Work
- Unnamed Item
- Unnamed Item
- On computing a conditional edge-connectivity of a graph
- On a kind of restricted edge connectivity of graphs
- Edge-cuts leaving components of order at least three
- 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
- Super edge- and point-connectivities of the Cartesian product of regular graphs
- On restricted edge-connectivity of graphs.
