The (signless) Laplacian spectral radius of unicyclic and bicyclic graphs with n vertices and k pendant vertices

DOI10.1007/s10587-010-0053-zzbMath1224.05311MaRDI QIDQ3073514

Muhuo Liu, Xuezhong Tan, Bo Lian Liu

Publication date: 11 February 2011

Published in: Czechoslovak Mathematical Journal (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/38045

zbMATH Keywords

spectral radius; Laplacian matrix; signless Laplacian matrix

Mathematics Subject Classification ID

05C38: Paths and cycles

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

05C75: Structural characterization of families of graphs

Related Items

Some graphs determined by their (signless) Laplacian spectra, Nordhaus-Gaddum-type result on the second largest signless Laplacian eigenvalue of a graph, The signless Laplacian spectral radius of tricyclic graphs and trees with \(k\) pendant vertices, Some results on the signless Laplacian spectra of unicyclic graphs, The Wiener index of unicyclic graphs given number of pendant vertices or cut vertices, Some graphs determined by their (signless) Laplacian spectra, Quotient of spectral radius, (signless) Laplacian spectral radius and clique number of graphs, The (signless) Laplacian spectral radii ofc-cyclic graphs withnvertices, girthgandkpendant vertices

Cites Work

• Unnamed Item
• The effect on the Laplacian spectral radius of a graph by adding or grafting edges
• Signless Laplacians of finite graphs
• The spectral radius of tricyclic graphs with \(n\) vertices and \(k\) pendent vertices
• The Laplacian spectral radii of trees with degree sequences
• A sharp lower bound for the least eigenvalue of the signless Laplacian of a non-bipartite graph
• On the Laplacian eigenvalues of a graph
• Laplacian matrices of graphs: A survey
• Algebraic graph theory without orientation
• An always nontrivial upper bound for Laplacian graph eigenvalues
• The spectral radius of trees on \(k\) pendant vertices
• Sharp upper bounds for the Laplacian graph eigenvalues
• Hamilton cycles and eigenvalues of graphs
• The spectral radius of unicyclic and bicyclic graphs with \(n\) vertices and \(k\) pendant vertices