Extraconnectivity of graphs with large girth
From MaRDI portal
Publication:1322225
DOI10.1016/0012-365X(92)00475-7zbMath0797.05058OpenAlexW1980395362MaRDI QIDQ1322225
Publication date: 5 May 1994
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(92)00475-7
Related Items
On \(g\)-extra connectivity of hypercube-like networks ⋮ Toughness of the corona of two graphs ⋮ A sufficient condition for graphs to be super \(k\)-restricted edge connected ⋮ Edge fault tolerance analysis of a class of interconnection networks ⋮ Parallel routing in regular networks with faults ⋮ On the reliability of generalized Petersen graphs ⋮ Sufficient conditions for \(k\)-restricted edge connected graphs ⋮ Fault-tolerant analysis of a class of networks ⋮ Disconnecting strongly regular graphs ⋮ Reliability evaluation of modified bubble-sort graph networks based on structure fault pattern ⋮ An anti-Ramsey theorem of \(k\)-restricted edge-cuts ⋮ Bounds for the Super Extra Edge Connectivity of Graphs ⋮ \(\{2,3\}\)-extraconnectivities of hypercube-like networks ⋮ On extra connectivity and extra edge-connectivity of balanced hypercubes ⋮ On the restricted connectivity and superconnectivity in graphs with given girth ⋮ 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 ⋮ On the super‐restricted arc‐connectivity of s ‐geodetic digraphs ⋮ On the restricted arc-connectivity of \(s\)-geodetic digraphs ⋮ On the extraconnectivity of graphs ⋮ A kind of conditional fault tolerance of alternating group graphs ⋮ On maximal 3-restricted edge connectivity and reliability analysis of hypercube networks ⋮ On reliability of the folded hypercubes ⋮ The largest component of faulty star graphs ⋮ Optimally restricted edge connected elementary Harary graphs ⋮ Vulnerability of super edge-connected networks ⋮ Connectivity for some families of composition networks ⋮ Fault-tolerant strong Menger (edge) connectivity and 3-extra edge-connectivity of balanced hypercubes ⋮ Sufficient conditions for triangle-free graphs to be super \(k\)-restricted edge-connected ⋮ On the edge-connectivity and restricted edge-connectivity of optimal 1-planar graphs ⋮ On super 2-restricted and 3-restricted edge-connected vertex transitive graphs ⋮ Two kinds of conditional connectivity of hypercubes ⋮ On extra connectivity and extra edge-connectivity of balanced hypercubes ⋮ Edge fault tolerance of graphs with respect to super edge connectivity ⋮ Concentration behavior: 50 percent of \(h\)-extra edge connectivity of pentanary \(n\)-cube with exponential faulty edges ⋮ \( R_3\)-connectivity of folded hypercubes ⋮ \(\{2,3\}\)-restricted connectivity of locally twisted cubes ⋮ Structure fault tolerance of balanced hypercubes ⋮ Extraconnectivity of \(k\)-ary \(n\)-cube networks ⋮ Sufficient conditions for maximally restricted edge connected graphs ⋮ On super connectivity of Cartesian product graphs ⋮ Edge fault tolerance of super edge connectivity for three families of interconnection networks ⋮ A sufficient condition for graphs to be \(\lambda_k\)-optimal ⋮ 3-extra connectivity of 3-ary \(n\)-cube networks ⋮ Sufficient conditions for graphs with girth \(g\) to be maximally \(k\)-restricted edge connected ⋮ Super \(s\)-restricted edge-connectivity of vertex-transitive graphs ⋮ Maximally edge-connected and vertex-connected graphs and digraphs: A survey ⋮ Diameter-girth sufficient conditions for optimal extraconnectivity in graphs ⋮ \(k\)-restricted edge connectivity in \((p+1)\)-clique-free graphs ⋮ Vertex-transitive graphs that remain connected after failure of a vertex and its neighbors ⋮ A kind of conditional connectivity of Cayley graphs generated by unicyclic graphs ⋮ Fault-free Hamiltonian cycles in crossed cubes with conditional link faults ⋮ K-restricted edge connectivity for some interconnection networks ⋮ On \(g\)-extra connectivity of folded hypercubes ⋮ On the complexity of computing the \(k\)-restricted edge-connectivity of a graph ⋮ The \(k\)-restricted edge-connectivity of the data center network DCell ⋮ Structure and substructure connectivity of balanced hypercubes ⋮ \(h\)-restricted connectivity of locally twisted cubes ⋮ On conditional diagnosability of the folded hypercubes ⋮ Edge fault tolerance of interconnection networks with respect to maximally edge-connectivity ⋮ 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 ⋮ The \(p\)-restricted edge-connectivity of Kneser graphs ⋮ Vulnerability of super extra edge-connected graphs ⋮ A general sufficient condition for a graph \(G\) with \(\lambda _{m }(G) \leqslant \zeta _{m }(G)\) ⋮ Unnamed Item ⋮ Sufficient conditions for a graph to be λ k -optimal with given girth and diameter ⋮ Vertex fault tolerance of optimal-\(\kappa \) graphs and super-\(\kappa \) graphs ⋮ 4-factor-criticality of vertex-transitive graphs ⋮ On the \(g\)-good-neighbor connectivity of graphs ⋮ Unnamed Item ⋮ Spectral threshold for extremal cyclic edge-connectivity ⋮ 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 ⋮ Minimally 3-restricted edge connected graphs ⋮ A neighborhood condition for graphs to be maximally \(k\)-restricted edge connected ⋮ 3-restricted connectivity of graphs with given girth ⋮ The \(h\)-extra connectivity of \(k\)-ary \(n\)-cubes ⋮ Sufficient conditions for bipartite graphs to be super-\(k\)-restricted edge connected ⋮ Characterization of component diagnosability of regular networks ⋮ The extra connectivity of the enhanced hypercubes ⋮ On the conditional edge connectivity of double-orbit graphs ⋮ Realizability of fault-tolerant graphs
Cites Work
