Diameter-girth sufficient conditions for optimal extraconnectivity in graphs
From MaRDI portal
Publication:932676
DOI10.1016/J.DISC.2007.07.012zbMATH Open1172.05035OpenAlexW2131628522MaRDI QIDQ932676FDOQ932676
Authors: C. Balbuena, A. Diánez, Xavier Marcote, Martín Cera, P. García-Vázquez 
Publication date: 11 July 2008
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2007.07.012
Recommendations
Cites Work
- Title not available (Why is that?)
- Extraconnectivity of graphs with large girth
- On the extraconnectivity of graphs
- Circulants and their connectivities
- Conditional connectivity
- Synthesis of reliable networks - a survey
- On computing a conditional edge-connectivity of a graph
- Super restricted edge-connectivity of vertex-transitive graphs
- Sufficient conditions for \(\lambda'\)-optimality in graphs of diameter 2
- Edge-cuts leaving components of order at least three
- Edge cuts leaving components of order at least \(m\)
- Sufficient conditions for λ′‐optimality in graphs with girth g
- On the restricted connectivity and superconnectivity in graphs with given girth
- Sufficient conditions for \(\lambda ^{\prime}\)-optimality of graphs with small conditional diameter
- Extraconnectivity of graphs with large minimum degree and girth
- Title not available (Why is that?)
Cited In (16)
- Vertex-transitive graphs that remain connected after failure of a vertex and its neighbors
- Cyclic arc-connectivity in a Cartesian product digraph
- \(\{2,3\}\)-extraconnectivities of hypercube-like networks
- A kind of conditional connectivity of Cayley graphs generated by unicyclic graphs
- Edge fault tolerance analysis of super \(k\)-restricted connected networks
- The \(k\)-restricted edge connectivity of undirected Kautz graphs
- On the restricted arc-connectivity of \(s\)-geodetic digraphs
- On the super-restricted arc-connectivity of \(s\)-geodetic digraphs
- The \(p\)-restricted edge-connectivity of Kneser graphs
- Sufficient conditions for a graph to be \(\lambda_k\)-optimal with given girth and diameter
- Sufficient conditions for graphs to be maximally 4-restricted edge connected
- The \(h\)-extra connectivity of \(k\)-ary \(n\)-cubes
- The existence and upper bound for two types of restricted connectivity
- On the 3-restricted edge connectivity of permutation graphs
- Extraconnectivity of graphs with large minimum degree and girth
- Connectedness of digraphs and graphs under constraints on the conditional diameter
This page was built for publication: Diameter-girth sufficient conditions for optimal extraconnectivity in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q932676)
