Spectral radius and traceability of graphs with large minimum degree
From MaRDI portal
Recommendations
- Spectral radius and Hamiltonicity of graphs
- Sufficient spectral conditions on Hamiltonian and traceable graphs
- Spectral sufficient conditions on traceable graphs
- Spectral radius and Hamiltonicity of graphs with large minimum degree.
- Some sufficient spectral conditions on Hamilton-connected and traceable graphs
Cites work
- A sharp upper bound of the spectral radius of graphs
- scientific article; zbMATH DE number 740754 (Why is no real title available?)
- On the first eigenvalue of bipartite graphs
- Some Inequalities for the Largest Eigenvalue of a Graph
- Spectral analogues of Erdős' and Moon-Moser's theorems on Hamilton cycles
- Spectral analogues of Moon-Moser's theorem on Hamilton paths in bipartite graphs
- Spectral radius and Hamiltonicity of graphs
- Spectral radius and Hamiltonicity of graphs with large minimum degree.
Cited in
(5)- Spectral radius and traceability of connected claw-free graphs
- Spectral radius and Hamiltonicity of graphs
- Spectral sufficient conditions of the existence of the longest path in the graph and its traceability
- On the normalized Laplacian spectral radius of traceable graphs
- Spectral radius of weighted adjacency matrix of trees based on Balaban index
This page was built for publication: Spectral radius and traceability of graphs with large minimum degree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5205786)
