On the reduced signless Laplacian spectrum of a degree maximal graph
From MaRDI portal
Publication:2267406
DOI10.1016/j.laa.2009.11.031zbMath1230.05202MaRDI QIDQ2267406
Publication date: 1 March 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.11.031
characteristic polynomial; signless Laplacian spectrum; neighborhood equivalence class; degree maximal graph; reduced signless Laplacian
05C35: Extremal problems in graph theory
05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)
15A18: Eigenvalues, singular values, and eigenvectors
05C07: Vertex degrees
Related Items
Connected graphs of fixed order and size with maximal \(Q\)-index: some spectral bounds, Connected graphs with maximal \(Q\)-index: The one-dominating-vertex case, Theorems on partitioned matrices revisited and their applications to graph spectra, Graphs with maximal signless Laplacian spectral radius
Cites Work
- Unnamed Item
- The Laplacian spectrum of a mixed graph
- Signless Laplacians of finite graphs
- Unoriented Laplacian maximizing graphs are degree maximal
- Variable neighborhood search for extremal graphs. 16. Some conjectures related to the largest eigenvalue of a graph
- The neighborhood inclusion structure of a graph
- Degree maximal graphs are Laplacian integral
- Which graphs are determined by their spectrum?
- Maximal graphs and graphs with maximal spectral radius
- Threshold graphs and related topics
- Laplacian spectra and spanning trees of threshold graphs
- Graphs with maximal signless Laplacian spectral radius
- Research problems from the Aveiro workshop on graph spectra
- Eigenvalue bounds for the signless laplacian
- Maximizing spectral radius of unoriented Laplacian matrix over bicyclic graphs of a given order
- On the Laplacian Eigenvalues of Signed Graphs