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

DOI10.5614/ejgta.2019.7.2.6zbMath1467.05150OpenAlexW2980333460MaRDI QIDQ5009953

Muhammad Ajmal, Tayyab Kamran, Masood Ur Rehman

Publication date: 23 August 2021

Published in: Electronic Journal of Graph Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.5614/ejgta.2019.7.2.6

zbMATH Keywords

treeeigenvaluesignless Laplacian matrix

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the signless Laplacian index of cacti with a given number of pendant vertices
• 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
• 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
• The least eigenvalue of the signless Laplacian of the complements of trees
• 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
• On energy, Laplacian energy and p-fold graphs
• Reciprocal Complementary Distance Spectra and Reciprocal Complementary Distance Energy of Line Graphs of Regular Graphs
• Weighted graphs: Eigenvalues and chromatic number
• Spectra of the extended neighborhood corona and extended corona of two graphs
• All trees are six-cordial
• On the spectrum of a class of distance-transitive graphs
• Spectra of graphs and the spectral criterion for property (T)
• Spanning k-ended trees of 3-regular connected graphs
• Bounds for the Laplacian spectral radius of graphs
• Distance matrices and quadratic embedding of graphs
• On maximum signless Laplacian Estrada index of graphs with given parameters II
• The structure of graphs with forbidden induced $C_4$, $\overline{C}_4$, $C_5$, $S_3$, chair and co-chair
• On distance signless Laplacian spectrum and energy of graphs

This page was built for publication: The second least eigenvalue of the signless Laplacian of the complements of trees