The smallest eigenvalue of the signless Laplacian

From MaRDI portal
Publication:550640

DOI10.1016/j.laa.2011.03.059zbMath1222.05180OpenAlexW1976554166MaRDI QIDQ550640

Vladimir Nikiforov, Carla Silva Oliveira, Leonardo Silva de Lima, Nair Maria Maia De Abreu

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




Related Items (39)

The clique number and the smallest \(Q\)-eigenvalue of graphsMerging the A-and Q-spectral theoriesThe domination number and the least \(Q\)-eigenvalueOn a conjecture related to the smallest signless Laplacian eigenvalue of graphsOn the smallest eigenvalue of Dα-matrix of connected graphsWeighted microscopic image reconstructionOrdering non-bipartite unicyclic graphs with pendant vertices by the least \(Q\)-eigenvalueSignless Laplacian energy of a graph and energy of a line graphOn the multiplicity of the least signless Laplacian eigenvalue of a graphMaximizing the least Q-eigenvalue of a unicyclic graph with perfect matchingsOn the \(A_\alpha\)-spectra of graphsDynamical systems associated with adjacency matricesBounds for the largest and the smallest \(A_\alpha\) eigenvalues of a graph in terms of vertex degreesThe least eigenvalue of signless Laplacian of non-bipartite graphs with given domination numberUnified spectral bounds on the chromatic numberThe least eigenvalue of signless Laplacian of graphs under perturbationSpectral bounds for the quantum chromatic number of quantum graphsSignless Laplacian spectrum of a graphOn the least distance eigenvalue of a graphOn the sign patterns of the smallest signless Laplacian eigenvectorA lower bound on the least signless Laplacian eigenvalue of a graphA sharp lower bound on the least signless Laplacian eigenvalue of a graphOn graphs with adjacency and signless Laplacian matrices eigenvectors entries in \(\{-1,+1\}\)Weighted microscopic image reconstructionDistance Laplacian eigenvalues and chromatic number in graphsMaximizing the least signless Laplacian eigenvalue of unicyclic graphsA note on the positive semidefiniteness of \(A_{\alpha}(G)\)Eigenvalue bounds for the signless \(p\)-LaplacianAn inertial lower bound for the chromatic number of a graphThe least \(Q\)-eigenvalue with fixed domination numberOn the least signless Laplacian eigenvalue of a non-bipartite connected graph with fixed maximum degreeLeast \(Q\)-eigenvalues of nonbipartite 2-connected graphsOn the least eigenvalue of \(A_\alpha \)-matrix of graphsBounds for the extremal eigenvalues of gain Laplacian matricesFurther results on the least Q-eigenvalue of a graph with fixed domination numberOn the smallest signless Laplacian eigenvalue of graphsSpectral lower bounds for the orthogonal and projective ranks of a graphSpectral lower bounds for the quantum chromatic number of a graphMore tales of Hoffman: bounds for the vector chromatic number of a graph



Cites Work


This page was built for publication: The smallest eigenvalue of the signless Laplacian