Some results on the bounds of signless Laplacian eigenvalues
From MaRDI portal
Publication:2017701
DOI10.1007/s40840-014-0008-xzbMath1308.05074OpenAlexW2067341227MaRDI QIDQ2017701
Publication date: 23 March 2015
Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40840-014-0008-x
Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Vertex degrees (05C07)
Related Items
On the Aα-spectral radius of connected graphs, On (distance) signless Laplacian spectra of graphs, Nordhaus-Gaddum-type result on the second largest signless Laplacian eigenvalue of a graph
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bounds on the (Laplacian) spectral radius of graphs
- Signless Laplacians of finite graphs
- Towards a spectral theory of graphs based on the signless Laplacian. II.
- Sharp bounds for the largest eigenvalue of the signless Laplacian of a graph
- Laplacian matrices of graphs: A survey
- Which graphs are determined by their spectrum?
- On the Laplacian spectral radius of a graph
- The largest eigenvalue of nonregular graphs
- Interlacing eigenvalues and graphs
- Laplacian spectral bounds for clique and independence numbers of graphs
- Eigenvalue bounds for the signless laplacian
- The maximum clique and the signless Laplacian eigenvalues
- Towards a spectral theory of graphs based on the signless Laplacian, I
- Eigenvalues of the Laplacian of a graph∗
- Eigenvectors of acyclic matrices
- Towards a spectral theory of graphs based on the signless Laplacian, III
- Maxima for Graphs and a New Proof of a Theorem of Turán