Extraconnectivity of graphs with large minimum degree and girth
From MaRDI portal
Publication:1356447
DOI10.1016/S0012-365X(96)00218-XzbMath0874.05033OpenAlexW2024535118MaRDI QIDQ1356447
Publication date: 9 November 1997
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(96)00218-x
Related Items (19)
Disconnecting strongly regular graphs ⋮ \(\{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 ⋮ Optimally restricted edge connected elementary Harary graphs ⋮ On super connectivity of Cartesian product graphs ⋮ Diameter-girth sufficient conditions for optimal extraconnectivity in graphs ⋮ Vertex-transitive graphs that remain connected after failure of a vertex and its neighbors ⋮ On the complexity of computing the \(k\)-restricted edge-connectivity of a graph ⋮ Connectivity measures in matched sum graphs ⋮ Edge fault tolerance analysis of super \(k\)-restricted connected networks ⋮ The \(p\)-restricted edge-connectivity of Kneser graphs ⋮ On \(g\)-extra conditional diagnosability of hierarchical cubic networks ⋮ On restricted connectivities of permutation graphs ⋮ Sufficient conditions for a graph to be λ k -optimal with given girth and diameter ⋮ Degree conditions for graphs to be \(\lambda_3\)-optimal and super-\(\lambda _3\) ⋮ On the Complexity of Computing the k-restricted Edge-connectivity of a Graph ⋮ On the 3-restricted edge connectivity of permutation graphs ⋮ Extraconnectivity of \(s\)-geodetic digraphs and graphs
Cites Work
This page was built for publication: Extraconnectivity of graphs with large minimum degree and girth
