The spectral radius and \({\mathcal{P}}_{\ge \ell}\)-factors of graphs involving minimum degree
From MaRDI portal
Publication:2093104
DOI10.1007/s00373-022-02584-xzbMath1502.05150OpenAlexW4306407071MaRDI QIDQ2093104
Publication date: 4 November 2022
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-022-02584-x
Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Unnamed Item
- Unnamed Item
- Regular factors and eigenvalues of regular graphs
- Regular factors of regular graphs from eigenvalues
- Spectra of graphs
- Spectral radius of graphs with given matching number
- The spectral radius of graphs without paths and cycles of specified length
- Matchings in regular graphs from eigenvalues
- A necessary and sufficient condition for the existence of a path factor every component of which is a path of length at least two
- Spectral extremal results with forbidding linear forests
- The spectral radius of graphs without long cycles
- Packing paths of length at least two
- Characterizing \(\mathcal{P}_{\geqslant 2} \)-factor and \(\mathcal{P}_{\geqslant 2} \)-factor covered graphs with respect to the size or the spectral radius
- Sufficient spectral radius conditions for Hamilton-connectivity of \(k\)-connected graphs
- Hamiltonian \(s\)-properties and eigenvalues of \(k\)-connected graphs
- The maximum spectral radius of \(t\)-connected graphs with bounded matching number
- The spectral Turán problem about graphs with no 6-cycle
- The maximum spectral radius of graphs without friendship subgraphs
- Spectral radius and matchings in graphs
- The spectral radius of graphs with no odd wheels
- On the spectral radius of graphs without a star forest
- The maximum spectral radius of wheel-free graphs
- On sufficient spectral radius conditions for Hamiltonicity
- Spectral radius and Hamiltonicity of graphs with large minimum degree
- Spectral analogues of Erdős’ and Moon–Moser’s theorems on Hamilton cycles
- Edge-Connectivity, Eigenvalues, and Matchings in Regular Graphs
- Sufficient conditions for the existence of a path‐factor which are related to odd components
- Spectral radius and Hamiltonicity of graphs
This page was built for publication: The spectral radius and \({\mathcal{P}}_{\ge \ell}\)-factors of graphs involving minimum degree
