On the extraconnectivity of graphs
From MaRDI portal
Publication:1923481
DOI10.1016/0012-365X(94)00369-TzbMATH Open0857.05064OpenAlexW1971967319MaRDI QIDQ1923481FDOQ1923481
Authors: J. Fàbrega, Miquel Angel Fiol 
Publication date: 6 March 1997
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(94)00369-t
Recommendations
Cites Work
- Extraconnectivity of graphs with large girth
- Circulants and their connectivities
- Conditional connectivity
- Title not available (Why is that?)
- Title not available (Why is that?)
- Maximally connected digraphs
- Sufficient conditions for maximally connected dense graphs
- Title not available (Why is that?)
- Strongly geodetic graphs
Cited In (only showing first 100 items - show all)
- On the conditional edge connectivity of double-orbit graphs
- Vertex-transitive graphs that remain connected after failure of a vertex and its neighbors
- On \(g\)-extra connectivity of hypercube-like networks
- On the extraconnectivity of \(k\)-ary \(n\)-cube networks
- Structure connectivity and substructure connectivity of twisted hypercubes
- Cyclic Vertex (Edge) Connectivity of Burnt Pancake Graphs
- On extra connectivity and extra edge-connectivity of balanced hypercubes
- Structure fault tolerance of WK-recursive networks
- Cyclic arc-connectivity in a Cartesian product digraph
- Vulnerability of super extra edge-connected graphs
- Fault-Tolerance of Star Graph Based on Subgraph Fault Pattern
- 3-restricted arc connectivity of digraphs
- Edge fault tolerance of interconnection networks with respect to maximally edge-connectivity
- Bounds for the super extra edge connectivity of graphs
- The \(g\)-extra conditional diagnosability of graphs in terms of \(g\)-extra connectivity
- A new proof for exact relationship between extra connectivity and extra diagnosability of regular connected graphs under MM* model
- Fault diagnosability of data center networks
- On extra connectivity and extra edge-connectivity of balanced hypercubes
- Equal relation between the extra connectivity and pessimistic diagnosability for some regular graphs
- The (strong) structure connectivity and (strong) substructure connectivity of the \(( n , k )\)-bubble-sort network
- Neighbor-connectivity of pancake networks and burnt pancake networks
- Bounds on the \(k\)-restricted arc connectivity of some bipartite tournaments
- Extra Connectivity and Structure Connectivity of 2-Dimensional Torus Networks
- Reliability evaluation of modified bubble-sort graph networks based on structure fault pattern
- Path and cycle fault tolerance of bubble-sort graph networks
- The structure fault tolerance of arrangement graphs
- Sufficient conditions for optimally and super m-restricted edge-connected graphs with given girth
- Structure and substructure connectivity of divide-and-swap cube
- On the \(g\)-good-neighbor connectivity of graphs
- Reliability measures in relation to the h-extra edge-connectivity of folded hypercubes
- Fault tolerance analysis of hierarchical folded cube
- The 2-extra connectivity of wheel networks
- The diagnosability of Möbius cubes for the \(g\)-extra condition
- Sufficient conditions for graphs to be maximally 4-restricted edge connected
- \( R_3\)-connectivity of folded hypercubes
- The 3-extra conditional diagnosability of balanced hypercubes under \(\mathrm{MM}^\ast\) model
- On \(g\)-extra conditional diagnosability of hierarchical cubic networks
- Reliability analysis of twisted cubes
- On computing of a conditional edge connectivity of alternating group network
- Reliability of the round matching composition networks based on \(g\)-extra conditional fault
- A cactus theorem for end cuts
- On the \(g\)-extra diagnosability of enhanced hypercubes
- Structure fault-tolerance of arrangement graphs
- The diagnosability of wheel networks with the condition: 2-extra
- Reliability analysis of the generalized balanced hypercube
- The \(g\)-extra connectivity and diagnosability of crossed cubes
- On the existence of edge cuts leaving several large components
- Degree conditions for graphs to be maximally \(k\)-restricted edge connected and super \(k\)-restricted edge connected
- Hybrid fault diagnosis capability analysis of regular graphs
- Neighbor connectivity of pancake graphs and burnt pancake graphs
- Structure and Substructure Connectivity of Hypercube-Like Networks
- Vulnerability of super edge-connected networks
- Extra diagnosability and good-neighbor diagnosability of \(n\)-dimensional alternating group graph \(AG _n\) under the PMC model
- Realizability of fault-tolerant graphs
- Relationship between conditional diagnosability and 2-extra connectivity of symmetric graphs
- Edge fault tolerance of graphs with respect to super edge connectivity
- Extraconnectivity of \(k\)-ary \(n\)-cube networks
- Connectivity measures in matched sum graphs
- The relationship between extra connectivity and conditional diagnosability of regular graphs under the PMC model
- On \(g\)-extra conditional diagnosability of hypercubes and folded hypercubes
- Structure connectivity and substructure connectivity of hypercubes
- On restricted connectivities of permutation graphs
- The \(g\)-extra conditional diagnosability and sequential \(t/k\)-diagnosability of hypercubes
- Maximally edge-connected and vertex-connected graphs and digraphs: A survey
- \(\{2,3\}\)-extraconnectivities of hypercube-like networks
- Structure connectivity of data center networks
- Vertex fault tolerance of optimal-\(\kappa \) graphs and super-\(\kappa \) graphs
- \(k\)-restricted edge-connectivity in triangle-free graphs
- Sufficient conditions for restricted-edge-connectivity to be optimal
- Title not available (Why is that?)
- Structure connectivity and substructure connectivity of wheel networks
- The extra connectivity and extra diagnosability of regular interconnection networks
- Super-connected edge transitive graphs
- Sufficient conditions for triangle-free graphs to be optimally restricted edge-connected
- Conditional connectivity of Cayley graphs generated by transposition trees
- Edge fault tolerance analysis of super \(k\)-restricted connected networks
- Extraconnectivity of hypercubes
- The extra connectivity, extra conditional diagnosability and \(t/k\)-diagnosability of the data center network DCell
- On the extra edge-connectivity of hypercubes
- The extra connectivity of bubble-sort star graphs
- Relating the extra connectivity and the conditional diagnosability of regular graphs under the comparison model
- The \(k\)-restricted edge connectivity of balanced bipartite graphs
- On \(g\)-extra connectivity of folded hypercubes
- Structure connectivity and substructure connectivity of star graphs
- On the restricted connectivity and superconnectivity in graphs with given girth
- Sufficient conditions for super \(k\)-restricted edge connectivity in graphs of diameter 2
- On the restricted arc-connectivity of \(s\)-geodetic digraphs
- On the super-restricted arc-connectivity of \(s\)-geodetic digraphs
- Fault tolerance of locally twisted cubes
- 3-extra connectivity of 3-ary \(n\)-cube networks
- On \(g\)-extra conditional diagnosability of twisted hypercubes under \(\mathrm{MM}^\ast\) model
- The \(p\)-restricted edge-connectivity of Kneser graphs
- Conditional connectivity of recursive interconnection networks respect to embedding restriction
- Conditional fault diagnosability of dual-cubes
- Sufficient conditions for a graph to be \(\lambda_k\)-optimal with given girth and diameter
- The \(h\)-extra connectivity and \(h\)-extra conditional diagnosability of bubble-sort star graphs
- Conditional connectivity of star graph networks under embedding restriction
- Structure connectivity and substructure connectivity of the crossed cube
- A general sufficient condition for a graph \(G\) with \(\lambda _{m }(G) \leqslant \zeta _{m }(G)\)
- Disconnecting strongly regular graphs
This page was built for publication: On the extraconnectivity of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1923481)
