Extraconnectivity of graphs with large girth

DOI10.1016/0012-365X(92)00475-7MaRDI QIDQ1322225zbMATH OpenOpenAlexFDO

Authors J. Fàbrega, Miquel Angel Fiol

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

zbMATH Keywords

conditional connectivitygirthvertex connectivityedge connectivityextraconnectivity

Mathematics Subject Classification ID

Connectivity (05C40)

Recommendations

• Extraconnectivity of graphs with large minimum degree and girth
• On the extraconnectivity of graphs
• Conditional graph connectivity relative to hereditary properties
• On conditional edge-connectivity of graphs

Cites work

• 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?)
• Circulants and their connectivities
• Conditional connectivity
• Maximally connected digraphs
• Strongly geodetic graphs
• Sufficient conditions for maximally connected dense graphs

Cited in

(93)

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

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)