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

DOI10.1016/J.DAM.2012.03.020zbMATH Open1245.05077OpenAlexW2003713730MaRDI QIDQ444443FDOQ444443

Authors: 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

Recommendations

• \(k\)-restricted edge-connectivity in triangle-free graphs
• Sufficient conditions for \(\lambda _k\)-optimality in triangle-free graphs
• Super 3-restricted edge connectivity of triangle-free graphs.
• Sufficient conditions for triangle-free graphs to be super-\(\lambda'\)
• Sufficient conditions for triangle-free graphs to be super \(k\)-restricted edge-connected

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (11)

• A characterization of graphs by codes from their incidence matrices
• Sufficient conditions for \(\lambda_3\)-optimality of triangle-free graphs
• Sufficient conditions for graphs to be super restricted edge connected
• \(k\)-restricted edge-connectivity in triangle-free graphs
• \(k\)-restricted edge connectivity in \((p+1)\)-clique-free graphs
• Sufficient conditions for \(k\)-restricted edge connected graphs
• Sufficient conditions for \(\lambda _k\)-optimality in triangle-free graphs
• Sufficient conditions for triangle-free graphs to be super \(k\)-restricted edge-connected
• Sufficient conditions for graphs with girth \(g\) to be maximally \(k\)-restricted edge connected
• Uniform scrambles on graphs
• Sufficient conditions for triangle-free graphs to be super-\(\lambda'\)

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

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