Bounds on the \(Q\)-spread of a graph

From MaRDI portal
Publication:962122

DOI10.1016/j.laa.2009.06.011zbMath1214.05082OpenAlexW2058054978MaRDI QIDQ962122

Leonardo Silva de Lima, Carla Silva Oliveira, Stephen J. Kirkland, Nair Maria Maia De Abreu

Publication date: 6 April 2010

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2009.06.011




Related Items (25)

Unnamed ItemMinimal spread of integral circulant graphsOn the signless Laplacian index of cacti with a given number of pendant verticesThe least eigenvalue of the signless Laplacian of the complements of treesOn a conjecture for the signless Laplacian spectral radius of cacti with given matching numberThe \(A_\alpha\)-spread of a graphSignless Laplacian spectrum of a graphGraph Limits and Spectral Extremal Problems for GraphsSome results on the signless Laplacian spectra of unicyclic graphsUnnamed ItemA lower bound on the least signless Laplacian eigenvalue of a graphA sharp lower bound on the least signless Laplacian eigenvalue of a graphNew bounds for the signless Laplacian spreadThe signless Laplacian or adjacency spectral radius of bicyclic graphs with given number of cut edgesOn conjectures involving second largest signless Laplacian eigenvalue of graphsProof of conjecture involving the second largest signless Laplacian eigenvalue and the index of graphsThe smallest eigenvalue of the signless LaplacianOn the two largest \(Q\)-eigenvalues of graphsBounds for different spreads of line and total graphsMaximizing signless Laplacian or adjacency spectral radius of graphs subject to fixed connectivityOn the least eigenvalue of \(A_\alpha \)-matrix of graphsProof of conjectures involving the largest and the smallest signless Laplacian eigenvalues of graphsSharp bounds on the signless Laplacian spread of graphsUnnamed ItemThe second least eigenvalue of the signless Laplacian of the complements of trees


Uses Software


Cites Work


This page was built for publication: Bounds on the \(Q\)-spread of a graph