Extraconnectivity of s-geodetic digraphs and graphs
From MaRDI portal
Publication:1296969
DOI10.1016/S0012-365X(98)00163-0zbMATH Open0927.05049MaRDI QIDQ1296969FDOQ1296969
Authors: C. Balbuena 
Publication date: 5 December 1999
Published in: Discrete Mathematics (Search for Journal in Brave)
Recommendations
Directed graphs (digraphs), tournaments (05C20) Distance in graphs (05C12) Paths and cycles (05C38) Connectivity (05C40)
Cites Work
- On the extraconnectivity of graphs
- Circulants and their connectivities
- Conditional connectivity
- Title not available (Why is that?)
- Title not available (Why is that?)
- Maximally connected digraphs
- Extraconnectivity of graphs with large minimum degree and girth
- A property of a-fragments of a digraph
- Large fault-tolerant interconnection networks
- Sufficient conditions for maximally connected dense graphs
- On the order and size of \(s\)-geodetic digraphs with given connectivity
- Title not available (Why is that?)
- Title not available (Why is that?)
- Strongly geodetic graphs
Cited In (9)
- Vertex-transitive graphs that remain connected after failure of a vertex and its neighbors
- On the super‐restricted arc‐connectivity of s ‐geodetic digraphs
- \(\{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
- 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)
