Sufficient conditions for triangle-free graphs to be optimally restricted edge-connected

DOI10.1016/j.dam.2012.03.020zbMath1245.05077OpenAlexW2003713730MaRDI QIDQ444443

Dirk Meierling, Lutz Volkmann

Publication date: 14 August 2012

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

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

zbMATH Keywords

triangle-free graphrestricted edge-connectivitysuper-\(\lambda _{k}\)\(\lambda _{k}\)-optimality

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Connectivity (05C40)

Related Items (4)

A characterization of graphs by codes from their incidence matrices ⋮ Unnamed Item ⋮ Sufficient conditions for graphs with girth \(g\) to be maximally \(k\)-restricted edge connected ⋮ \(k\)-restricted edge connectivity in \((p+1)\)-clique-free graphs

Cites Work

• Unnamed Item
• \(k\)-restricted edge-connectivity in triangle-free graphs
• The \(k\)-restricted edge connectivity of balanced bipartite graphs
• Super \(p\)-restricted edge connectivity of line graphs
• Edge fault tolerance analysis of super \(k\)-restricted connected networks
• On computing a conditional edge-connectivity of a graph
• Edge-cuts leaving components of order at least three
• On the extraconnectivity of graphs
• Sufficient conditions for restricted-edge-connectivity to be optimal
• A proof of an inequality concerning \(k\)-restricted edge connectivity
• Sufficient conditions for a graph to be λ _k -optimal with given girth and diameter
• Neighborhood conditions for graphs to be super restricted edge connected
• Conditional connectivity
• On restricted edge-connectivity of graphs.

This page was built for publication: Sufficient conditions for triangle-free graphs to be optimally restricted edge-connected