Super restricted edge connectivity of regular edge-transitive graphs
From MaRDI portal
Recommendations
Cites work
- A complete classification of cubic symmetric graphs of girth 6
- Circulants and their connectivities
- Combinatorial optimization problems in the analysis and design of probabilistic networks
- Connectivity of transitive graphs
- Edge-cuts leaving components of order at least three
- Half-transitive group actions on finite graphs of valency 4
- Hamiltonicity of cubic Cayley graphs
- scientific article; zbMATH DE number 1600999 (Why is no real title available?)
- scientific article; zbMATH DE number 4089584 (Why is no real title available?)
- scientific article; zbMATH DE number 3685495 (Why is no real title available?)
- scientific article; zbMATH DE number 3735859 (Why is no real title available?)
- scientific article; zbMATH DE number 2010366 (Why is no real title available?)
- scientific article; zbMATH DE number 854567 (Why is no real title available?)
- scientific article; zbMATH DE number 857069 (Why is no real title available?)
- scientific article; zbMATH DE number 5244599 (Why is no real title available?)
- Maximally edge-connected and vertex-connected graphs and digraphs: A survey
- Minimale \(n\)-fach kantenzusammenhängende Graphen
- On a kind of restricted edge connectivity of graphs
- On computing a conditional edge-connectivity of a graph
- On restricted edge-connectivity of graphs.
- On super connectivity of Cartesian product graphs
- Sufficient conditions for a graph to be super restricted edge-connected
- Sufficient conditions for graphs to be λ′‐optimal and super‐λ′
- Super edge connectivity properties of connected edge symmetric graphs
- Super restricted edge connectivity of regular graphs
- Super restricted edge-connectivity of vertex-transitive graphs
- Tetravalent edge-transitive graphs of girth at most 4
- Theory and Application of Graphs
Cited in
(18)- Super restricted edge-connectivity of vertex-transitive graphs
- Some results about the reliability of folded hypercubes
- Edge-transitive bi-Cayley graphs
- A classification of cubic connected bi-dicirculants
- Super cyclically edge-connected vertex-transitive graphs of girth at least 5
- Super-cyclically edge-connected regular graphs
- Super restricted edge connectivity of regular graphs
- scientific article; zbMATH DE number 5670535 (Why is no real title available?)
- A characterization of graphs by codes from their incidence matrices
- On super 2-restricted and 3-restricted edge-connected vertex transitive graphs
- Super edge connectivity properties of connected edge symmetric graphs
- Super restricted edge connectivity of regular graphs with two orbits
- On computing of a conditional edge connectivity of alternating group network
- A brief account on the development and future research directions of connectivity properties of interconnection networks
- On the reliability of modified bubble-sort graphs
- On the super (edge)-connectivity of generalized Johnson graphs
- Characterization of minimum restricted arc-cuts of unidirectional hypercubes
- The automorphisms of bi-Cayley graphs
This page was built for publication: Super restricted edge connectivity of regular edge-transitive graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q423941)
