The least eigenvalue of the signless Laplacian of the complements of trees

DOI10.1016/j.laa.2011.09.032zbMath1238.05162MaRDI QIDQ2427927

Shujing Wang, Shuchao Li

Publication date: 19 April 2012

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.09.032

zbMATH Keywords

tree; signless Laplacian matrix; least eigenvalue; complement

Mathematics Subject Classification ID

05C05: Trees

05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)

15A18: Eigenvalues, singular values, and eigenvectors

Related Items

The second least eigenvalue of the signless Laplacian of the complements of trees, Maximizing the least Q-eigenvalue of a unicyclic graph with perfect matchings, The distance spectrum of the complements of graphs of diameter greater than three, The distance spectrum of the complements of graphs with two pendent vertices, Extremal problems for the eccentricity matrices of complements of trees, Ordering non-bipartite unicyclic graphs with pendant vertices by the least \(Q\)-eigenvalue, Maximizing the least signless Laplacian eigenvalue of unicyclic graphs, On the least \(Q\)-eigenvalue of a non-bipartite Hamiltonian graph, On the second minimum algebraic connectivity of the graphs whose complements are trees, The least algebraic connectivity of graphs, The least signless Laplacian eignvalue of the complements of unicyclic graphs, On the least signless Laplacian eigenvalue of a non-bipartite connected graph with fixed maximum degree, On minimum algebraic connectivity of graphs whose complements are bicyclic, The least eigenvalue of graphs whose complements have only two pendent vertices

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Signless Laplacians of finite graphs
• Unoriented Laplacian maximizing graphs are degree maximal
• A sharp lower bound for the least eigenvalue of the signless Laplacian of a non-bipartite graph
• Towards a spectral theory of graphs based on the signless Laplacian. II.
• Bounds on the \(Q\)-spread of a graph
• The signless Laplacian spectral radius of graphs with given degree sequences
• Bounds on the index of the signless Laplacian of a graph
• Bounds and conjectures for the signless Laplacian index of graphs
• On the signless Laplacian spectral radius of graphs with cut vertices
• On the maximal signless Laplacian spectral radius of graphs with given matching number
• On graphs whose signless Laplacian index does not exceed 4.5
• First eigenvalue and first eigenvectors of a nonsingular unicyclic mixed graph
• The signless Laplacian spectral radius of graphs with given number of pendant vertices
• Laplacian matrices of graphs: A survey
• Which graphs are determined by their spectrum?
• Sharp upper and lower bounds for largest eigenvalue of the Laplacian matrices of trees
• Minimizing the Laplacian spectral radius of trees with given matching number
• Maximizing spectral radius of unoriented Laplacian matrix over bicyclic graphs of a given order
• The maximum clique and the signless Laplacian eigenvalues
• Towards a spectral theory of graphs based on the signless Laplacian, I
• On three conjectures involving the signless Laplacian spectral radius of graphs
• Eigenvalues of the Laplacian of a graph^∗
• Eigenvectors of acyclic matrices
• [https://portal.mardi4nfdi.de/wiki/Publication:4337503 Open problems of Paul Erd�s in graph theory]