The signless Laplacian spectral radius of graphs with given number of pendant vertices

DOI10.1007/s00373-009-0840-1zbMath1194.05085OpenAlexW1968724426MaRDI QIDQ1043812

Dan Yang, Yi-Zheng Fan

Publication date: 9 December 2009

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-009-0840-1

zbMATH Keywords

graphspectral radiussignless Laplacian matrixpendant vertex

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)

Related Items (16)

Signless Laplacian spectral characterization of some disjoint union of graphs ⋮ On the maximal α-spectral radius of graphs with given matching number ⋮ The signless Laplacian spectral radius of bicyclic graphs with prescribed degree sequences ⋮ Bipartiteness and the least eigenvalue of signless Laplacian of graphs ⋮ On the signless Laplacian index of cacti with a given number of pendant vertices ⋮ The least eigenvalue of the signless Laplacian of the complements of trees ⋮ On a conjecture for the signless Laplacian spectral radius of cacti with given matching number ⋮ Sharp bounds on the \(A_{\alpha}\)-index of graphs in terms of the independence number ⋮ On the signless Laplacian index of unicyclic graphs with fixed diameter ⋮ The least signless Laplacian eignvalue of the complements of unicyclic graphs ⋮ The signless Laplacian or adjacency spectral radius of bicyclic graphs with given number of cut edges ⋮ The signless Laplacian spectrum of rooted product of graphs ⋮ The signless Laplacian spectral radius of tricyclic graphs and trees with \(k\) pendant vertices ⋮ The minimum signless Laplacian spectral radius of graphs with given independence number ⋮ Maximizing signless Laplacian or adjacency spectral radius of graphs subject to fixed connectivity ⋮ The second least eigenvalue of the signless Laplacian of the complements of trees

Cites Work

• Unnamed Item
• Signless Laplacians of finite graphs
• Unoriented Laplacian maximizing graphs are degree maximal
• Laplacian matrices of graphs: A survey
• Algebraic graph theory without orientation
• Which graphs are determined by their spectrum?
• Enumeration of cospectral graphs.
• The spectral radius of trees on \(k\) pendant vertices
• 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
• Eigenvalues of the Laplacian of a graph^∗
• Eigenvectors of acyclic matrices
• A characterization of the smallest eigenvalue of a graph
• Signless Laplacians and line graphs

This page was built for publication: The signless Laplacian spectral radius of graphs with given number of pendant vertices