Extraconnectivity of s-geodetic digraphs and graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4162905 (Why is no real title available?)
- scientific article; zbMATH DE number 4089545 (Why is no real title available?)
- scientific article; zbMATH DE number 3455291 (Why is no real title available?)
- scientific article; zbMATH DE number 3547328 (Why is no real title available?)
- A property of a-fragments of a digraph
- Circulants and their connectivities
- Conditional connectivity
- Extraconnectivity of graphs with large minimum degree and girth
- Large fault-tolerant interconnection networks
- Maximally connected digraphs
- On the extraconnectivity of graphs
- On the order and size of s-geodetic digraphs with given connectivity
- Strongly geodetic graphs
- Sufficient conditions for maximally connected dense graphs
Cited in
(9)- Vertex-transitive graphs that remain connected after failure of a vertex and its neighbors
- \(\{2,3\}\)-extraconnectivities of hypercube-like networks
- Super-connected arc-transitive digraphs
- Edge fault tolerance analysis of super \(k\)-restricted connected networks
- Bounds on the \(k\)-restricted arc connectivity of some bipartite tournaments
- On the restricted arc-connectivity of \(s\)-geodetic digraphs
- On the super-restricted arc-connectivity of \(s\)-geodetic digraphs
- 3-extra connectivity of 3-ary \(n\)-cube networks
- Diameter-girth sufficient conditions for optimal extraconnectivity in graphs
This page was built for publication: Extraconnectivity of \(s\)-geodetic digraphs and graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1296969)
