Optimally super-edge-connected transitive graphs
From MaRDI portal
Recommendations
- On super 2-restricted and 3-restricted edge-connected vertex transitive graphs
- On super restricted edge-connectivity of vertex-transitive graphs
- Super-edge-connected and optimally super-edge-connected bi-Cayley graphs.
- On super restricted edge-connectivity of edge-transitive graphs
- Super-connected edge transitive graphs
Cited in
(50)- Sufficient conditions for super \(k\)-restricted edge connectivity in graphs of diameter 2
- Minimally 3-restricted edge connected graphs
- Sufficient conditions for bipartite graphs to be super-\(k\)-restricted edge connected
- Edges of degree \(k\) in minimally restricted \(k\)-edge connected graphs
- The k-restricted edge connectivity of undirected Kautz graphs
- On restricted edge-connectivity of replacement product graphs
- Sufficient conditions for graphs with girth \(g\) to be maximally \(k\)-restricted edge connected
- Connectivity of half vertex transitive digraphs
- On super restricted edge connectivity of half vertex transitive graphs
- Vulnerability of super extra edge-connected graphs
- \( R_3\)-connectivity of folded hypercubes
- Edge fault-tolerance analysis of maximally edge-connected graphs and super edge-connected graphs
- On the edge-connectivity of graphs with two orbits of the same size
- Degree conditions for graphs to be maximally k-restricted edge connected and super k-restricted edge connected
- Matching preclusion for cube-connected cycles
- A sufficient condition for graphs to be super \(k\)-restricted edge connected
- Fault-tolerant analysis of a class of networks
- Sufficient conditions for restricted-edge-connectivity to be optimal
- On optimally-\(\lambda^{(3)}\) transitive graphs
- A proof of an inequality concerning \(k\)-restricted edge connectivity
- Matching preclusion for vertex-transitive networks
- On restricted edge-connectivity of vertex-transitive multigraphs
- Sufficient conditions for k-restricted edge connected graphs
- Vertex-transitive graphs that remain connected after failure of a vertex and its neighbors
- Super-edge-connected and optimally super-edge-connected bi-Cayley graphs.
- Bounds for the super extra edge connectivity of graphs
- scientific article; zbMATH DE number 5670535 (Why is no real title available?)
- Optimally restricted edge connected elementary Harary graphs
- Vulnerability of super edge-connected networks
- On super 2-restricted and 3-restricted edge-connected vertex transitive graphs
- Edge fault tolerance of graphs with respect to super edge connectivity
- Super restricted edge connectivity of regular graphs with two orbits
- scientific article; zbMATH DE number 2077809 (Why is no real title available?)
- On Isoperimetric Connectivity in Vertex-Transitive Graphs
- Sufficient conditions for optimally and super m-restricted edge-connected graphs with given girth
- \(h\)-restricted connectivity of locally twisted cubes
- On the conditional edge connectivity of double-orbit graphs
- Super \(\lambda_3\)-optimality of regular graphs
- Minimally 4-restricted edge connected graphs
- On super restricted edge-connectivity of edge-transitive graphs
- A neighborhood condition for graphs to be maximally \(k\)-restricted edge connected
- Degree conditions for restricted-edge-connectivity and isoperimetric-edge-connectivity to be optimal
- \(\{2,3\}\)-restricted connectivity of locally twisted cubes
- Maximally edge-connected and vertex-connected graphs and digraphs: A survey
- Edge-connectivity of regular graphs with two orbits
- Extra edge connectivity and isoperimetric edge connectivity
- Minimally restricted edge connected graphs
- Sufficient conditions for \(\lambda _k\)-optimality in triangle-free graphs
- \(\lambda _c\)-Optimally half vertex transitive graphs with regularity \(k\)
- Super edge-connectivity of mixed Cayley graph
This page was built for publication: Optimally super-edge-connected transitive graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1861264)
