On the conditional edge connectivity of double-orbit graphs
From MaRDI portal
Publication:5864393
DOI10.2298/FIL1918935ZzbMath1499.05338WikidataQ126302691 ScholiaQ126302691MaRDI QIDQ5864393
Publication date: 7 June 2022
Published in: Filomat (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On super 2-restricted and 3-restricted edge-connected vertex transitive graphs
- Super restricted edge connectivity of regular graphs with two orbits
- Maximally edge-connected and vertex-connected graphs and digraphs: A survey
- Edge-connectivity of regular graphs with two orbits
- Super edge-connectivity of mixed Cayley graph
- On computing a conditional edge-connectivity of a graph
- Extraconnectivity of graphs with large girth
- On a kind of restricted edge connectivity of graphs
- Super restricted edge-connectivity of vertex-transitive graphs
- Edge-cuts leaving components of order at least three
- Optimally super-edge-connected transitive graphs
- On the extraconnectivity of graphs
- On super restricted edge connectivity of half vertex transitive graphs
- On the edge-connectivity of graphs with two orbits of the same size
- On optimally-\(\lambda^{(3)}\) transitive graphs
- Minimale \(n\)-fach kantenzusammenhängende Graphen
- A proof of an inequality concerning \(k\)-restricted edge connectivity
- On Moore Graphs with Diameters 2 and 3
- Conditional connectivity
- Connectivity of transitive graphs
- On restricted edge-connectivity of graphs.
