Sufficient conditions for triangle-free graphs to be super-$λ'$

DOI10.22108/toc.2018.106623.1523zbMath1463.05307OpenAlexW2907122064MaRDI QIDQ5135464

Yanjing Li, Hui-Wen Cheng

Publication date: 20 November 2020

Full work available at URL: https://doaj.org/article/9c84e8884aa8419f8d680a634254ff28

zbMATH Keywords

triangle-freerestricted edge-cutsuper-\(\lambda^\prime\)

Mathematics Subject Classification ID

Connectivity (05C40) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Unnamed Item
• Sufficient conditions for \(\lambda _k\)-optimality in triangle-free graphs
• Degree conditions for graphs to be \(\lambda_3\)-optimal and super-\(\lambda _3\)
• On computing a conditional edge-connectivity of a graph
• Super restricted edge-connectivity of vertex-transitive graphs
• Sufficient conditions for \(\lambda'\)-optimality in graphs of diameter 2
• Sufficient conditions for graphs to be ??-optimal, super-edge-connected, and maximally edge-connected

This page was built for publication: Sufficient conditions for triangle-free graphs to be super-$λ'$