Tight isolated toughness bound for fractional \((k, n)\)-critical graphs

DOI10.1016/j.dam.2022.08.028zbMath1498.05079OpenAlexW4295981808WikidataQ114191367 ScholiaQ114191367MaRDI QIDQ2081483

Yaojun Chen, Wei Gao, Wei Fan Wang

Publication date: 13 October 2022

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

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

zbMATH Keywords

fractional \(k\)-factorisolated toughnessfractional \((k,n)\)-critical graph

Mathematics Subject Classification ID

Distance in graphs (05C12) Graph theory (05C99)

Related Items (2)

Sufficient conditions for graphs to have strong parity factors ⋮ Feasibility of data transmission under attack: from isolated toughness variant perspective

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On toughness and fractional \((g,f,n)\)-critical graphs
• On path-factor critical deleted (or covered) graphs
• A note on fractional ID-\( [ a , b \)-factor-critical covered graphs]
• Toughness and the existence of fractional \(k\)-factors of graphs
• New isolated toughness condition for fractional $(g,f,n)$-critical graphs
• Independence number and connectivity for fractional (a, b, k)-critical covered graphs
• TOUGHNESS, ISOLATED TOUGHNESS AND PATH FACTORS IN GRAPHS

This page was built for publication: Tight isolated toughness bound for fractional \((k, n)\)-critical graphs