For b > a, every connected n-vertex graph with minimum degree at least a and spectral radius at least rho(H^{a,b}_n) contains an [a,b]-factor, except H^{a,b}_n itself.
Spectral conditions for graphs to contain $k$-factors
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
Let $G$ be a graph. The spectral radius $\rho(G)$ of $G$ is the largest eigenvalue of its adjacency matrix. For an integer $k\geq1$, a $k$-factor of $G$ is a $k$-regular spanning subgraph of $G$. Assume that $k$ and $n$ are integers satisfying $k\geq2,kn\equiv0~(\mod2)$ and $n\geq\max\left\{k^{2}+6k+7,20k+10\right\}$. Let $G$ be a graph of order $n$ and with minimum degree at least $k$. In this paper, we give a sharp lower bound of $\rho(G)$ to guarantee that $G$ contains a $k$-factor.
citation-role summary
background 1
citation-polarity summary
fields
math.SP 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
A note on the spectral radius and $[a,b]$-factor of graphs
For b > a, every connected n-vertex graph with minimum degree at least a and spectral radius at least rho(H^{a,b}_n) contains an [a,b]-factor, except H^{a,b}_n itself.