The existence of a \ K₁, 2, K₁, 3, K₅ \-factor based on the size or the A_ -spectral radius of graphs
Let \(G\) be a graph with adjacency matrix \(A(G)\), and let \(D(G)\) denote the diagonal matrix of the degrees of \(G\). \textit{V. Nikiforov} [Appl. Anal. Discrete Math. 11, No. 1, 81--107 (2017; Zbl 1499.05384)] introduced a unifying framework for the adjacency matrix \(A(G)\) and the signless Laplacian \(Q(G)\) by considering the convex linear combination\N\[\NA_\alpha(G) = \alpha D(G) + (1-\alpha)A(G), \quad 0 \leq \alpha \leq 1.\N\]\NIn the present paper, the authors establish two distinct sufficient conditions, one in terms of the number of edges and the other in terms of the \(A_\alpha\)-spectral radius, that guarantee a connected graph admits a \(\{K_{1,2}, K_{1,3}, K_{5}\}\)-factor.
- A note on the \(A_{\alpha}\)-spectral radius of graphs
- A spectral condition for component factors in graphs
- An extension of Tutte's 1-factor theorem
- Characterizing \(\mathcal{P}_{\geqslant 2} \)-factor and \(\mathcal{P}_{\geqslant 2} \)-factor covered graphs with respect to the size or the spectral radius
- Characterizing star factors via the size, the spectral radius or the distance spectral radius of graphs
- Component factors with large components in graphs
- Graphs determined by their \(A_\alpha\)-spectra
- Merging the \(A\)- and \(Q\)-spectral theories
- On the spectrum of an equitable quotient matrix and its application
- Star-factors with large components
- Star-like factors with large components
- The A_-spectral radius for path-factors in graphs
This page was built for publication: The existence of a \(\{ K_{1, 2}, K_{1, 3}, K_5 \}\)-factor based on the size or the \(A_\alpha \)-spectral radius of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6930356)
