Sufficient conditions on the existence of factors in graphs involving minimum degree.
(English).Czechoslovak Mathematical Journal,
vol. 74
(2024),
issue 4,
pp. 1299-1311
Summary: For a set $\{A, B, C, \ldots \}$ of graphs, an $\{A, B, C, \ldots \}$-factor of a graph $G$ is a spanning subgraph $F$ of $G$, where each component of $F$ is contained in $\{A, B, C, \ldots \}$. It is very interesting to investigate the existence of factors in a graph with given minimum degree from the prospective of eigenvalues. We first propose a tight sufficient condition in terms of the $Q$-spectral radius for a graph involving minimum degree to contain a star factor. Moreover, we also present tight sufficient conditions based on the $Q$-spectral radius and the distance spectral radius for a graph involving minimum degree to guarantee the existence of a $\{K_2, \{C_k\}\}$-factor, respectively.
References:
[1] Akiyama, J., Avis, D., Era, H.: On a $\{1,2\}$-factor of a graph. TRU Math. 16 (1980), 97-102. MR 0616992 | Zbl 0461.05047
[4] Berman, A., Plemmons, R. J.: Nonnegative Matrices in the Mathematical Sciences. Computer Science and Applied Mathematics. Academic Press, New York (1979). DOI 10.1137/1.9781611971262 | MR 0544666 | Zbl 0484.15016
[14] Lou, J., Liu, R., Ao, G.: Fractional matching, factors and spectral radius in graphs involving minimum degree. Linear Algebra Appl. 677 (2023), 337-351. DOI 10.1016/j.laa.2023.08.010 | MR 4637628 | Zbl 1521.05105
[15] Miao, S., Li, S.: Characterizing star factors via the size, the spectral radius or the distance spectral radius of graphs. Discrete Appl. Math. 326 (2023), 17-32. DOI 10.1016/j.dam.2022.11.006 | MR 4517408 | Zbl 1504.05176