Sufficient conditions for triangle-free graphs to be super \(k\)-restricted edge-connected

DOI10.1016/J.IPL.2015.09.005zbMath1346.68149OpenAlexW1515033817MaRDI QIDQ894466

Jun Yuan, Aixia Liu

Publication date: 1 December 2015

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2015.09.005

zbMATH Keywords

fault tolerancetriangle-free graphrestricted edge connectivitysuper-restricted edge connectivity

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15) Connectivity (05C40)

Related Items (1)

Arc fault tolerance of Kautz digraphs

Cites Work

• Unnamed Item
• \(k\)-restricted edge connectivity in \((p+1)\)-clique-free graphs
• Degree conditions for restricted-edge-connectivity and isoperimetric-edge-connectivity to be optimal
• Sufficient conditions for \(\lambda _k\)-optimality in triangle-free graphs
• Sufficient conditions for super \(k\)-restricted edge connectivity in graphs of diameter 2
• Sufficient conditions for bipartite graphs to be super-\(k\)-restricted edge connected
• On computing a conditional edge-connectivity of a graph
• Extraconnectivity of graphs with large girth
• Size in maximal triangle-free graphs and minimal graphs of diameter 2
• Edge-cuts leaving components of order at least three
• Degree conditions for graphs to be maximally \(k\)-restricted edge connected and super \(k\)-restricted edge connected
• A proof of an inequality concerning \(k\)-restricted edge connectivity
• Edge cuts leaving components of order at least \(m\)
• Sufficient conditions for graphs to be λ′‐optimal and super‐λ′
• On super-edge-connected digraphs and bipartite digraphs

This page was built for publication: Sufficient conditions for triangle-free graphs to be super \(k\)-restricted edge-connected