Extraconnectivity of s-geodetic digraphs and graphs
The \(\eta\)-extraconnectivity \(\kappa _\eta\) of a (di)graph \(G\) is the minimum cardinality of a set of vertices whose deletion disconnects \(G\) in such a way that all remaining (strongly) connected components have cardinality greater than \(\eta\). A (di)graph \(G\) with diameter \(D>1\) is said to be \(s\)-geodetic, \(1\leq s\leq D\), if for any two of its vertices \(x\) and \(y\) there exists at most one \(x\)-\(y\) path of length not exceeding \(s\). Starting from results of the paper by \textit{C. Balbuena, A. Carmona, J. Fábrega} and \textit{M. A. Fiol} [Discrete Math. 167/168, 85-100 (1997; Zbl 0874.05033)] sufficient conditions are given to assure the maximum \(\eta\)-extraconnectivity of such a digraph with minimum degree \(\delta\). Similar conditions are given for \(s\)-geodetic digraphs. The corresponding edge versions of these results are also discussed.
- A property of a-fragments of a digraph
- Circulants and their connectivities
- Conditional connectivity
- Extraconnectivity of graphs with large minimum degree and girth
- 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?)
- 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
- Super-connected arc-transitive digraphs
- On the order and size of s-geodetic digraphs with given connectivity
- Bounds on the \(k\)-restricted arc connectivity of some bipartite tournaments
- 3-extra connectivity of 3-ary \(n\)-cube networks
- Vertex-transitive graphs that remain connected after failure of a vertex and its neighbors
- \(\{2,3\}\)-extraconnectivities of hypercube-like networks
- On the super-restricted arc-connectivity of s-geodetic digraphs
- On the restricted arc-connectivity of \(s\)-geodetic digraphs
- Diameter-girth sufficient conditions for optimal extraconnectivity in graphs
- Edge fault tolerance analysis of super \(k\)-restricted connected networks
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)
