A sufficient condition for graphs to be _k-optimal

DOI10.1016/J.DAM.2013.05.037MaRDI QIDQ2446896zbMATH OpenOpenAlexFDO

Authors Ruixia Wang, Shiying Wang

Publication date 23 April 2014

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2013.05.037

zbMATH Keywords

\(\lambda_k\)-optimality\(k\)-restricted edge connectivityedge-cutneighborhood

Mathematics Subject Classification ID

Connectivity (05C40)

Recommendations

• Sufficient conditions for a graph to be _k-optimal with given girth and diameter
• Sufficient conditions for super \(k\)-restricted edge connectivity in graphs of diameter 2
• Sufficient conditions for restricted-edge-connectivity to be optimal
• Sufficient conditions for k-restricted edge connected graphs
• A neighborhood condition for graphs to be maximally \(k\)-restricted edge connected

Cites work

• A neighborhood condition for graphs to be maximally \(k\)-restricted edge connected
• Edge-cuts leaving components of order at least three
• 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 the 3-restricted edge connectivity of permutation graphs
• Sufficient conditions for '-optimality in graphs of diameter 2
• Sufficient conditions for super \(k\)-restricted edge connectivity in graphs of diameter 2
• Sufficient conditions for λ′‐optimality in graphs with girth g

Cited in

(11)

• Sufficient conditions for super \(k\)-restricted edge connectivity in graphs of diameter 2
• Sufficient conditions for '-optimality in graphs of diameter 2
• A sufficient \(Q\)-spectral condition for a graph to be \(\beta\)-deficient involving minimum degree
• Degree conditions for graphs to be maximally k-restricted edge connected and super k-restricted edge connected
• Sufficient conditions for restricted-edge-connectivity to be optimal
• scientific article; zbMATH DE number 6672459 (Why is no real title available?)
• Local restricted edge connectivity and restricted edge connectivity of graphs.
• Sufficient conditions for _k-optimality and super-_k in graphs
• Sufficient conditions for a graph to be _k-optimal with given girth and diameter
• A neighborhood condition for graphs to be maximally \(k\)-restricted edge connected
• Sufficient conditions for \(\lambda _k\)-optimality in triangle-free graphs

This page was built for publication: A sufficient condition for graphs to be \(\lambda_k\)-optimal

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