Spectral radius and traceability of graphs with large minimum degree
From MaRDI portal
Publication:5205786
DOI10.1080/03081087.2018.1500520zbMath1429.05135OpenAlexW2887369129WikidataQ114641439 ScholiaQ114641439MaRDI QIDQ5205786
Publication date: 16 December 2019
Published in: Linear and Multilinear Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03081087.2018.1500520
Trees (05C05) Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)
Cites Work
- Unnamed Item
- Spectral analogues of Moon-Moser's theorem on Hamilton paths in bipartite graphs
- On the first eigenvalue of bipartite graphs
- A sharp upper bound of the spectral radius of graphs
- Spectral radius and Hamiltonicity of graphs with large minimum degree
- Spectral analogues of Erdős’ and Moon–Moser’s theorems on Hamilton cycles
- Some Inequalities for the Largest Eigenvalue of a Graph
- Spectral radius and Hamiltonicity of graphs
This page was built for publication: Spectral radius and traceability of graphs with large minimum degree