Tight isolated toughness bound for fractional (k, n)-critical graphs
From MaRDI portal
Publication:2081483
Recommendations
Cites work
- A note on fractional ID-\( [ a , b ]\)-factor-critical covered graphs
- A result on restricted fractional (g,f)-factors in graphs
- Fractional (g,f)-factors in graphs
- Fractional factors and isolated toughness of graphs
- Graph theory
- Independence number and connectivity for fractional \((a, b, k)\)-critical covered graphs
- New isolated toughness condition for fractional (g,f,n)-critical graphs
- On path-factor critical deleted (or covered) graphs
- On toughness and fractional (g,f,n)-critical graphs
- Toughness and the existence of fractional k-factors of graphs
- Toughness, isolated toughness and path factors in graphs
Cited in
(23)- Tight toughness condition for fractional (g,f,n)-critical graphs
- scientific article; zbMATH DE number 6390837 (Why is no real title available?)
- New isolated toughness condition for fractional (g,f,n)-critical graphs
- Fractional factors and isolated toughness of graphs
- Sufficient conditions for graphs to have strong parity factors
- Feasibility of data transmission under attack: from isolated toughness variant perspective
- A sufficient condition for a graph to be fractional (k,n)-critical
- On toughness and fractional (g,f,n)-critical graphs
- Spanning k-trees and distance signless Laplacian spectral radius of graphs
- Star-factors with large components, fractional k-extendability and spectral radius in graphs
- Characterizing spanning trees via the size or the spectral radius of graphs
- Sharp isolated toughness bound for fractional \((k, m)\)-deleted graphs
- Decision making strategy for - I equilibrium problem in network designing
- Tight isolated toughness bound for fractional (a,b,m)-deleted graphs
- Spanning subgraphs and spectral radius in graphs
- Tight toughness variant condition for fractional k-factors
- Toughness, fractional extendability and distance spectral radius in graphs
- Spectral conditions for component factors in graphs involving minimum degree
- Laplacian eigenvalue condition for a graph to have the strong parity property
- Characterizations of fractional factor-critical graphs via size and spectral radius
- On the Hermite and Mathieu special characterizations to the logarithmic Zakharov-Kuznetsov equations
- Isolated toughness condition for fractional (a, b, m)-covered graphs
- Spectral radius and size conditions for fractional (a,b,l)-critical graphs
This page was built for publication: Tight isolated toughness bound for fractional \((k, n)\)-critical graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2081483)
