Super restricted edge connectivity of regular graphs
From MaRDI portal
Publication:2494101
DOI10.1007/S00373-005-0600-9zbMATH Open1089.05039OpenAlexW2088914048MaRDI QIDQ2494101FDOQ2494101
Authors: Ou Jianping, Fuji Zhang 
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
Recommendations
- Restricted edge connectivity of regular graphs
- Sufficient conditions for graphs to be super restricted edge connected
- Super restricted edge connectivity of regular edge-transitive graphs
- A sufficient condition for graphs to be super \(k\)-restricted edge connected
- Super restricted edge-connectivity of graphs with diameter 2
Cites Work
- The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
- Graph theory with applications
- 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
- Title not available (Why is that?)
- On restricted edge-connectivity of graphs.
- Super edge- and point-connectivities of the Cartesian product of regular graphs
- Combinatorial optimization problems in the analysis and design of probabilistic networks
Cited In (21)
- A characterization of graphs by codes from their incidence matrices
- Super restricted edge connectivity of regular edge-transitive graphs
- Title not available (Why is that?)
- Super restricted edge connected Cartesian product graphs
- Maximally edge-connected and vertex-connected graphs and digraphs: A survey
- Sufficient conditions for maximally restricted edge connected graphs
- Restrict edge-connectivity of circular graphs
- On super connectedness and super restricted edge-connectedness of total graphs.
- Super-cyclically edge-connected regular graphs
- On restricted edge-connectivity of lexicographic product graphs
- Super restricted edge-connectivity of vertex-transitive graphs
- The \(p\)-restricted edge-connectivity of Kneser graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Super 3-restricted edge connectivity of triangle-free graphs.
- A sufficient condition for graphs to be super \(k\)-restricted edge connected
- Super \(p\)-restricted edge connectivity of line graphs
- A proof of an inequality concerning \(k\)-restricted edge connectivity
- On optimizing edge connectivity of product graphs
- On restricted edge-connectivity of replacement product graphs
- Restricted edge connectivity of regular graphs
This page was built for publication: Super restricted edge connectivity of regular graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2494101)
