The smallest eigenvalue of the signless Laplacian
From MaRDI portal
Publication:550640
DOI10.1016/J.LAA.2011.03.059zbMATH Open1222.05180OpenAlexW1976554166MaRDI QIDQ550640FDOQ550640
Leonardo Silva de Lima, Nair Abreu, Vladimir Nikiforov, Carla Silva Oliveira
Publication date: 13 July 2011
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2011.03.059
Recommendations
- On the smallest signless Laplacian eigenvalue of graphs
- On the least signless Laplacian eigenvalues of some graphs
- scientific article; zbMATH DE number 5642103
- On the multiplicity of the least signless Laplacian eigenvalue of a graph
- The smallest signless Laplacian spectral radius of graphs with a given clique number
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Extremal problems in graph theory (05C35)
Cites Work
- Towards a spectral theory of graphs based on the signless Laplacian, III
- Enumeration of cospectral graphs.
- Eigenvalue bounds for the signless laplacian
- A sharp lower bound for the least eigenvalue of the signless Laplacian of a non-bipartite graph
- Properties of spectra of graphs and line graphs
- On conjectures involving second largest signless Laplacian eigenvalue of graphs
- Towards a spectral theory of graphs based on the signless Laplacian. I
- A characterization of the smallest eigenvalue of a graph
- Towards a spectral theory of graphs based on the signless Laplacian. II.
- Signless Laplacians and line graphs
- The signless Laplacian spread
- The Eigenvalues of a Graph and Its Chromatic Number
- Bounds on the \(Q\)-spread of a graph
- On the spectrum of the quasi-Laplacian matrix of a graph
- ON EIGENVALUES AND COLORINGS OF GRAPHS, II
Cited In (42)
- Unified spectral bounds on the chromatic number
- The clique number and the smallest \(Q\)-eigenvalue of graphs
- Weighted microscopic image reconstruction
- Weighted microscopic image reconstruction
- More tales of Hoffman: bounds for the vector chromatic number of a graph
- On the \(A_\alpha\)-spectra of graphs
- Eigenvalue bounds for the signless \(p\)-Laplacian
- Spectral lower bounds for the orthogonal and projective ranks of a graph
- On graphs with adjacency and signless Laplacian matrices eigenvectors entries in \(\{-1,+1\}\)
- The domination number and the least \(Q\)-eigenvalue
- Signless Laplacian energy of a graph and energy of a line graph
- Bounds for the largest and the smallest \(A_\alpha\) eigenvalues of a graph in terms of vertex degrees
- The least \(Q\)-eigenvalue with fixed domination number
- On a conjecture related to the smallest signless Laplacian eigenvalue of graphs
- Ordering non-bipartite unicyclic graphs with pendant vertices by the least \(Q\)-eigenvalue
- The least eigenvalue of signless Laplacian of non-bipartite graphs with given domination number
- Least \(Q\)-eigenvalues of nonbipartite 2-connected graphs
- Spectral bounds for the quantum chromatic number of quantum graphs
- On the multiplicity of the least signless Laplacian eigenvalue of a graph
- On the least signless Laplacian eigenvalue of a non-bipartite connected graph with fixed maximum degree
- Signless Laplacian spectrum of a graph
- A lower bound on the least signless Laplacian eigenvalue of a graph
- On the Smallest Eigenvalue of Grounded Laplacian Matrices
- On the least eigenvalue of \(A_\alpha \)-matrix of graphs
- The least eigenvalue of signless Laplacian of graphs under perturbation
- On the least distance eigenvalue of a graph
- Title not available (Why is that?)
- Unifying adjacency, Laplacian, and signless Laplacian theories
- Spectral lower bounds for the quantum chromatic number of a graph
- Merging the A-and Q-spectral theories
- Distance Laplacian eigenvalues and chromatic number in graphs
- On the smallest signless Laplacian eigenvalue of graphs
- Maximizing the least Q-eigenvalue of a unicyclic graph with perfect matchings
- A note on the positive semidefiniteness of \(A_{\alpha}(G)\)
- Maximizing the least signless Laplacian eigenvalue of unicyclic graphs
- Dynamical systems associated with adjacency matrices
- Further results on the least Q-eigenvalue of a graph with fixed domination number
- On the smallest eigenvalue of Dα-matrix of connected graphs
- Bounds for the extremal eigenvalues of gain Laplacian matrices
- An inertial lower bound for the chromatic number of a graph
- On the sign patterns of the smallest signless Laplacian eigenvector
- A sharp lower bound on the least signless Laplacian eigenvalue of a graph
This page was built for publication: The smallest eigenvalue of the signless Laplacian
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q550640)
