Extraconnectivity of graphs with large girth
From MaRDI portal
Recommendations
Cites work
- Circulants and their connectivities
- Conditional connectivity
- 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?)
- Maximally connected digraphs
- Strongly geodetic graphs
- Sufficient conditions for maximally connected dense graphs
Cited in
(98)- Degree conditions for graphs to be \(\lambda_3\)-optimal and super-\(\lambda _3\)
- On the 3-restricted edge connectivity of permutation graphs
- Minimally 3-restricted edge connected graphs
- 3-restricted connectivity of graphs with given girth
- Sufficient conditions for bipartite graphs to be super-\(k\)-restricted edge connected
- Extraconnectivity of graphs with large minimum degree and girth
- On conditional edge-connectivity of graphs
- Parallel routing in regular networks with faults
- On the reliability of generalized Petersen graphs
- A kind of conditional fault tolerance of alternating group graphs
- The \(b\)-continuity of graphs with large girth
- Fault-tolerant strong Menger (edge) connectivity and 3-extra edge-connectivity of balanced hypercubes
- Sufficient conditions for graphs with girth \(g\) to be maximally \(k\)-restricted edge connected
- Edge fault tolerance of interconnection networks with respect to maximally edge-connectivity
- On the extraconnectivity of graphs
- Structure and substructure connectivity of balanced hypercubes
- The \(p\)-restricted edge-connectivity of Kneser graphs
- Vulnerability of super extra edge-connected graphs
- Spectral threshold for extremal cyclic edge-connectivity
- Characterization of component diagnosability of regular networks
- Reliability evaluation of modified bubble-sort graph networks based on structure fault pattern
- An anti-Ramsey theorem of \(k\)-restricted edge-cuts
- The largest component of faulty star graphs
- \( R_3\)-connectivity of folded hypercubes
- Structure fault tolerance of balanced hypercubes
- The \(k\)-restricted edge-connectivity of the data center network DCell
- On the \(g\)-good-neighbor connectivity of graphs
- The \(h\)-extra connectivity of \(k\)-ary \(n\)-cubes
- The extra connectivity of the enhanced hypercubes
- On \(g\)-extra connectivity of hypercube-like networks
- A sufficient condition for graphs to be super \(k\)-restricted edge connected
- Edge fault tolerance analysis of a class of interconnection networks
- Fault-tolerant analysis of a class of networks
- On extra connectivity and extra edge-connectivity of balanced hypercubes
- A sufficient condition for graphs to be \(\lambda_k\)-optimal
- 3-extra connectivity of 3-ary \(n\)-cube networks
- Fault-free Hamiltonian cycles in crossed cubes with conditional link faults
- On conditional diagnosability of the folded hypercubes
- Realizability of fault-tolerant graphs
- Disconnecting strongly regular graphs
- Connectivity and diagnosability of center \(k\)-ary \(n\)-cubes
- Edge-disjoint paths in faulty augmented cubes
- A new approach to finding the extra connectivity of graphs
- On \(g\)-good-neighbor conditional connectivity and diagnosability of hierarchical star networks
- Connectivity for some families of composition networks
- On the complexity of computing the \(k\)-restricted edge-connectivity of a graph
- Toughness of the corona of two graphs
- r-regular r-connected graphs with large girth
- Sufficient conditions for k-restricted edge connected graphs
- Vertex-transitive graphs that remain connected after failure of a vertex and its neighbors
- Sufficient conditions for a graph to be _k-optimal with given girth and diameter
- Bounds for the super extra edge connectivity of graphs
- On super connectivity of Cartesian product graphs
- \(\{2,3\}\)-extraconnectivities of hypercube-like networks
- Optimally restricted edge connected elementary Harary graphs
- Vulnerability of super edge-connected networks
- On super 2-restricted and 3-restricted edge-connected vertex transitive graphs
- Edge fault tolerance of graphs with respect to super edge connectivity
- Extraconnectivity of k-ary n-cube networks
- Sufficient conditions for maximally restricted edge connected graphs
- Edge fault tolerance of super edge connectivity for three families of interconnection networks
- Super \(s\)-restricted edge-connectivity of vertex-transitive graphs
- k-restricted edge connectivity in (p+1)-clique-free graphs
- A kind of conditional connectivity of Cayley graphs generated by unicyclic graphs
- On g-extra connectivity of folded hypercubes
- On the complexity of computing the \(k\)-restricted edge-connectivity of a graph
- On the \(p\)-restricted edge connectivity of the bipartite Kneser graph \(H(n,k)\)
- \(h\)-restricted connectivity of locally twisted cubes
- On the super-restricted arc-connectivity of s-geodetic digraphs
- Sufficient conditions for graphs to be maximally 4-restricted edge connected
- scientific article; zbMATH DE number 2188339 (Why is no real title available?)
- On extra connectivity and extra edge-connectivity of balanced hypercubes
- On the conditional edge connectivity of double-orbit graphs
- On the restricted arc-connectivity of \(s\)-geodetic digraphs
- On maximal 3-restricted edge connectivity and reliability analysis of hypercube networks
- On the edge-connectivity and restricted edge-connectivity of optimal 1-planar graphs
- Two kinds of conditional connectivity of hypercubes
- Concentration behavior: 50 percent of \(h\)-extra edge connectivity of pentanary \(n\)-cube with exponential faulty edges
- Reliability analyses of regular graphs based on edge-structure connectivity
- Non-inclusive g-extra diagnosability of regular networks under the MM* model
- Structure connectivity of folded crossed cubes based on faulty stars
- Reliability evaluation of conditional recursive networks under h-conditional restriction
- \(\{ 1, 2, 3 \}\)-extra connectivity of Cayley graphs generated by \(k\)-trees
- 4-factor-criticality of vertex-transitive graphs
- Fault tolerance evaluation of a new of recursive network
- A neighborhood condition for graphs to be maximally \(k\)-restricted edge connected
- On the restricted connectivity and superconnectivity in graphs with given girth
- On reliability of the folded hypercubes
- Sufficient conditions for triangle-free graphs to be super k-restricted edge-connected
- \(\{2,3\}\)-restricted connectivity of locally twisted cubes
- Maximally edge-connected and vertex-connected graphs and digraphs: A survey
- Diameter-girth sufficient conditions for optimal extraconnectivity in graphs
- K-restricted edge connectivity for some interconnection networks
- Edge fault tolerance analysis of super \(k\)-restricted connected networks
- Sufficient conditions for \(\lambda _k\)-optimality in triangle-free graphs
- The existence and upper bound for two types of restricted connectivity
- A general sufficient condition for a graph \(G\) with \(\lambda _{m }(G) \leqslant \zeta _{m }(G)\)
- Vertex fault tolerance of optimal-\(\kappa \) graphs and super-\(\kappa \) graphs
This page was built for publication: Extraconnectivity of graphs with large girth
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1322225)