Super s-restricted edge-connectivity of vertex-transitive graphs
From MaRDI portal
(Redirected from Publication:477258)
Super \(s\)-restricted edge-connectivity of vertex-transitive graphs
Super \(s\)-restricted edge-connectivity of vertex-transitive graphs
Recommendations
- Super restricted edge-connectivity of vertex-transitive graphs
- On super restricted edge-connectivity of vertex-transitive graphs
- On super restricted edge-connectivity of edge-transitive graphs
- On super 2-restricted and 3-restricted edge-connected vertex transitive graphs
- scientific article; zbMATH DE number 1545446
Cites work
- scientific article; zbMATH DE number 3685495 (Why is no real title available?)
- scientific article; zbMATH DE number 857069 (Why is no real title available?)
- scientific article; zbMATH DE number 2192189 (Why is no real title available?)
- A general sufficient condition for a graph \(G\) with \(\lambda _{m }(G) \leqslant \zeta _{m }(G)\)
- A proof of an inequality concerning \(k\)-restricted edge connectivity
- Bound on \(m\)-restricted edge connectivity
- Connectivity of transitive graphs
- Edge cuts leaving components of order at least \(m\)
- Edge-cuts leaving components of order at least three
- Extraconnectivity of graphs with large girth
- Minimale \(n\)-fach kantenzusammenhängende Graphen
- On computing a conditional edge-connectivity of a graph
- On cyclic edge-connectivity of transitive graphs
- On optimally-\(\lambda^{(3)}\) transitive graphs
- On super 2-restricted and 3-restricted edge-connected vertex transitive graphs
- Sufficient conditions for bipartite graphs to be super-\(k\)-restricted edge connected
- Sufficient conditions for super \(k\)-restricted edge connectivity in graphs of diameter 2
- Super cyclically edge connected transitive graphs
- Super restricted edge-connectivity of vertex-transitive graphs
- The Connectivities of a Graph and its Complement
Cited in
(5)- Super restricted edge-connectivity of vertex-transitive graphs
- On super 2-restricted and 3-restricted edge-connected vertex transitive graphs
- On super restricted edge-connectivity of edge-transitive graphs
- On the \(p\)-restricted edge connectivity of the bipartite Kneser graph \(H(n,k)\)
- On super restricted edge-connectivity of vertex-transitive graphs
This page was built for publication: Super \(s\)-restricted edge-connectivity of vertex-transitive graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q477258)