Abstract
In recent years, research on the spectral extremal problems of fractional [a,b]-factors has attracted the attention of many scholars. The main content of our research is the generalization of fractional [a,b]-factors, namely fractional (a,b,l)-critical graph. Let a and b be two positive integers. A graph G is called a fractional (a,b,l)-critical graph if after deleting any l vertices of G the remaining graph of G has a fractional [a,b]-factor. In this paper, we present spectral radius and size conditions for a graph to be fractional (a,b,l)-critical.
| Original language | English |
|---|---|
| Article number | 100958 |
| Journal | Discrete Optimization |
| Volume | 61 |
| DOIs | |
| State | Published - Aug 2026 |
Keywords
- Fractional (a, b, l)-critical
- Fractional [a, b]-factor
- Size
- Spectral radius
Fingerprint
Dive into the research topics of 'Spectral radius and size conditions for fractional (a,b,l)-critical graphs'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver