Minimizing the Laplacian spectral radius of trees with given matching number

From MaRDI portal
Publication:3422771

DOI10.1080/03081080600790040zbMath1117.05075OpenAlexW2049209676MaRDI QIDQ3422771

Qiao Li, Li-Hua Feng, Xiao Dong Zhang

Publication date: 14 February 2007

Published in: Linear and Multilinear Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03081080600790040




Related Items (22)

Signless Laplacian spectral radius of graphs without short cycles or long cyclesMaxima of the \(Q\)-index of non-bipartite graphs: forbidden short odd cyclesThe effect on the (signless Laplacian) spectral radii of uniform hypergraphs by subdividing an edgeThe signless Laplacian spectral radius of bicyclic graphs with prescribed degree sequencesOn the signless Laplacian index of cacti with a given number of pendant verticesThe least eigenvalue of the signless Laplacian of the complements of treesOn a conjecture for the signless Laplacian spectral radius of cacti with given matching numberGraphs whose signless Laplacian spectral radius does not exceed the Hoffman limit valueThe minimal Laplacian spectral radius of trees with given matching numberSharp upper bounds of $A_\alpha$-spectral radius of cacti with given pendant verticesTowards a spectral theory of graphs based on the signless Laplacian. II.The Laplacian spectral radius of trees and maximum vertex degreeThe signless Laplacian spectral radius of graphs with given degree sequencesThe signless Laplacian spectral radius of tricyclic graphs and trees with \(k\) pendant verticesThe Laplacian spectral radius for unicyclic graphs with given independence numberSome notes on the spectral perturbations of the signless Laplacian of a graphOn graphs whose signless Laplacian index does not exceed 4.5The signless Laplacian spectral radius of graphs with given number of pendant verticesThe second least eigenvalue of the signless Laplacian of the complements of treesGRAPHS WITH SMALL INDEPENDENCE NUMBER MINIMIZING THE SPECTRAL RADIUSOn the spectral radius of a class of non-odd-bipartite even uniform hypergraphsAn extremal problem on Q-spectral radii of graphs with given size and matching number



Cites Work


This page was built for publication: Minimizing the Laplacian spectral radius of trees with given matching number