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
- The structure fault tolerance of alternating group networks
- Enhancing fault tolerance of balanced hypercube networks by the edge partition method
- Reliability and hybrid diagnosis of exchanged hypercube
- Reliability measure of multiprocessor system based on enhanced hypercubes
- On the \(g\)-extra connectivity of augmented cubes
- The extra connectivity of the enhanced hypercubes
- Edge-disjoint paths in faulty augmented cubes
- Relation of extra edge connectivity and component edge connectivity for regular networks
- Reliability analyses of regular graphs based on edge-structure connectivity
- Fault tolerance of composite graph based on disc-ring and folded hypercube
- Super fault-tolerance assessment of locally twisted cubes based on the structure connectivity
- Cluster connectivity and super cluster connectivity of half hypercube networks
- On anti-Kekulé and \(s\)-restricted matching preclusion problems
- Fault tolerability analysis of folded crossed cubes based on \(g\)-component and \(g\)-good neighbor fault pattern
- Star fault tolerance of hypercube
- Title not available (Why is that?)
- Addible edges in 2-matching-connected graphs and 3-matching-connected graphs
- The structure fault tolerance of burnt pancake networks
- \(h\)-extra \(r\)-component connectivity of interconnection networks with application to hypercubes
- Generalized fault-tolerance for enhanced hypercubes
- Link fault tolerance of BC networks and folded hypercubes on \(h\)-extra \(r\)-component edge-connectivity
- Sufficient Conditions for Maximally k-Isoperimetric Edge Connectivity of Graphs
- Cluster connectivity of hypercube-based networks under the super fault-tolerance condition
- An anti-Ramsey theorem of \(k\)-restricted edge-cuts
- Relating \(g\)-good-neighbor connectivity and \(g\)-good-neighbor diagnosability of strong digraph network
- High fault-tolerant performance of the divide-and-swap cube network
- Connectivity and diagnosability of the complete Josephus cube networks under \(h\)-extra fault-tolerant model
- On the extension of connected irregular (λ,μ)-graphs
- On the 3-Extra Connectivity of Enhanced Hypercubes
- Connectivity for some families of composition networks
- Note on reliability of star graphs
- Reliability measure of the \(n\)-th Cartesian product of complete graph \(K_4\) on \(h\)-extra edge-connectivity
- Reliability evaluation for bijection-connected networks based on the super \(P_k\)-connectivity
- Structure fault-tolerance of divide-and-swap \(k\)-ary \(n\)-cube
- The \(h\)-extra connectivity of \(k\)-ary \(n\)-cubes
- An O(log(N)) Algorithm View: Reliability Evaluation of Folded-crossed Hypercube in Terms of h-extra Edge-connectivity
- Conditional diagnosability of the \(\mathit{SP}_n\) graphs under the comparison diagnosis model
- Extra (component) connectivity and diagnosability of bubble sort networks
- Many-to-many edge-disjoint paths in \((n,k)\)-enhanced hypercube under three link-faulty hypotheses
- Reliability evaluation for a class of recursive match networks
- Concentration behavior: 50 percent of \(h\)-extra edge connectivity of pentanary \(n\)-cube with exponential faulty edges
- Edge fault tolerance of graphs with respect to \(\lambda_{2}\)-optimal property
- Reliability of \(m\)-ary \(n\)-dimensional hypercubes under embedded restriction
- 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
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)