Remarks on Spectral Radius and Laplacian Eigenvalues of a Graph
From MaRDI portal
Publication:3366758
DOI10.1007/s10587-005-0064-3zbMath1081.05068OpenAlexW2006096184MaRDI QIDQ3366758
Publication date: 14 February 2006
Published in: Czechoslovak Mathematical Journal (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/30987
Related Items (11)
Spectral characterization of multicone graphs ⋮ Bounds on graph eigenvalues. I ⋮ A note on eigenvalues of signed graphs ⋮ Sufficient spectral conditions for graphs being k-edge-Hamiltonian or k-Hamiltonian ⋮ Graph realizations associated with minimizing the maximum eigenvalue of the Laplacian ⋮ Adjacency eigenvalues of graphs without short odd cycles ⋮ Sufficient conditions for Hamilton-connected graphs in terms of (signless Laplacian) spectral radius ⋮ Spectral radius and Hamiltonian properties of graphs ⋮ Eigenvalues and triangles in graphs ⋮ Bounds for the Laplacian spectral radius of graphs ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Bounds of eigenvalues of graphs
- Laplacian matrices of graphs: A survey
- A sharp upper bound on the largest eigenvalue of the Laplacian matrix of a graph
- A bound on the spectral radius of graphs with \(e\) edges
- A sharp upper bound of the spectral radius of graphs
- Some Inequalities for the Largest Eigenvalue of a Graph
- The Laplacian Spectrum of a Graph II
- On the \(k\)th largest eigenvalue of the Laplacian matrix of a graph
This page was built for publication: Remarks on Spectral Radius and Laplacian Eigenvalues of a Graph