Sufficient conditions for maximally restricted edge connected graphs

DOI10.1016/J.DISC.2012.05.008MaRDI QIDQ449147zbMATH OpenOpenAlexFDO

Authors Yingying Qin, Jianping Ou

Publication date 12 September 2012

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2012.05.008

zbMATH Keywords

degree sequencerestricted edge connectivity

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex degrees (05C07) Connectivity (05C40)

Recommendations

• Sufficient conditions for graphs to be ??-optimal, super-edge-connected, and maximally edge-connected
• On optimizing restricted edge connectivity of graphs
• Sufficient conditions for restricted-edge-connectivity to be optimal
• Sufficient conditions for graphs to be \({\lambda^\prime}\)-optimal
• Sufficient conditions for λ′‐optimality in graphs with girth g

Cites work

• scientific article; zbMATH DE number 1332751 (Why is no real title available?)
• scientific article; zbMATH DE number 1545446 (Why is no real title available?)
• scientific article; zbMATH DE number 2197917 (Why is no real title available?)
• Combinatorial optimization problems in the analysis and design of probabilistic networks
• Edge cuts leaving components of order at least \(m\)
• Extraconnectivity of graphs with large girth
• Graph theory
• Maximally edge-connected and vertex-connected graphs and digraphs: A survey
• On computing a conditional edge-connectivity of a graph
• On graphs with equal edge connectivity and minimum degree
• Restricted edge connectivity of regular graphs
• Sufficient conditions for graphs to be λ′‐optimal and super‐λ′
• Sufficient conditions for graphs to be ??-optimal, super-edge-connected, and maximally edge-connected
• Sufficient conditions for λ′‐optimality in graphs with girth g
• Super restricted edge connectivity of regular graphs

Cited in

(6)

• A necessary and sufficient condition for a graph to be edge tenacious
• Sufficient Conditions for Maximally k-Isoperimetric Edge Connectivity of Graphs
• scientific article; zbMATH DE number 5521219 (Why is no real title available?)
• \(k\)-restricted edge connectivity in \((p+1)\)-clique-free graphs
• Essential Constraints of Edge-Constrained Proximity Graphs
• Sufficient conditions for \(k\)-restricted edge connected graphs

This page was built for publication: Sufficient conditions for maximally restricted edge connected graphs

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