3-restricted connectivity of graphs with given girth

DOI10.1007/S11766-008-1908-ZMaRDI QIDQ1032795zbMATH OpenOpenAlexFDO

Authors Litao Guo, Jixiang Meng

Publication date 11 November 2009

Published in Applied Mathematics. Series B (English Edition) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11766-008-1908-z

zbMATH Keywords

3-restricted connectivity3-restricted cutgirth

Mathematics Subject Classification ID

Connectivity (05C40)

Recommendations

• Sufficient conditions for a graph to be super 3-restricted connected with given girth
• scientific article; zbMATH DE number 2192189
• On the restricted connectivity and superconnectivity in graphs with given girth
• Minimally 3-restricted edge connected graphs
• scientific article; zbMATH DE number 5052357

Cites work

• Conditional edge connectivity properties, reliability comparisons and transitivity of graphs
• Degree conditions for restricted-edge-connectivity and isoperimetric-edge-connectivity to be optimal
• Edge cuts leaving components of order at least \(m\)
• Edge-cuts leaving components of order at least three
• Extraconnectivity of graphs with large girth
• On a kind of restricted edge connectivity of graphs
• On computing a conditional edge-connectivity of a graph
• On restricted edge-connectivity of graphs.
• On the restricted connectivity and superconnectivity in graphs with given girth
• Sufficient conditions for λ′‐optimality in graphs with girth g

Cited in

(4)

• Minimally 3-restricted edge connected graphs
• Upper bound on the third edge-connectivity of graphs
• Sufficient conditions for a graph to be super 3-restricted connected with given girth
• On maximal 3-restricted edge connectivity of regular graphs

This page was built for publication: 3-restricted connectivity of graphs with given girth

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1032795)