The \(A_\alpha\)-spectral radius for path-factors in graphs
From MaRDI portal
Publication:6204351
DOI10.1016/j.disc.2024.113940MaRDI QIDQ6204351
Yuli Zhang, Zhi-ren Sun, Si-zhong Zhou
Publication date: 27 March 2024
Published in: Discrete Mathematics (Search for Journal in Brave)
Paths and cycles (05C38) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Signless Laplacian spectral radius and fractional matchings in graphs
- Component factors with large components in graphs
- An extension of Tutte's 1-factor theorem
- Graphs determined by their \(A_\alpha\)-spectra
- On the \(\alpha\)-index of graphs with pendent paths
- A note on the \(A_{\alpha}\)-spectral radius of graphs
- Interlacing eigenvalues and graphs
- On the spectrum of an equitable quotient matrix and its application
- Positive semidefiniteness of \(A_\alpha (G)\) on some families of graphs
- A neighborhood union condition for fractional \((a, b, k)\)-critical covered graphs
- Some results on path-factor critical avoidable graphs
- On path-factor critical deleted (or covered) graphs
- Path factors in subgraphs
- Spectral radius and matchings in graphs
- Perfect matching and distance spectral radius in graphs and bipartite graphs
- The \(A_\alpha\)-spectral radius and perfect matchings of graphs
- Two sufficient conditions for odd \([1,b\)-factors in graphs]
- Some sufficient conditions for path-factor uniform graphs
- Spectral conditions for graphs to be β-deficient involving minimum degree
- Merging the A-and Q-spectral theories
- Isolated toughness for path factors in networks
- The existence of path-factor uniform graphs with large connectivity
- TOUGHNESS, ISOLATED TOUGHNESS AND PATH FACTORS IN GRAPHS
- Degree conditions for the existence of a {P2, P5}-factor in a graph
- Path-factor critical covered graphs and path-factor uniform graphs
This page was built for publication: The \(A_\alpha\)-spectral radius for path-factors in graphs