Sharp upper and lower bounds for largest eigenvalue of the Laplacian matrices of trees

DOI10.1016/J.DISC.2005.04.001zbMATH Open1068.05044OpenAlexW1986098644MaRDI QIDQ2487982FDOQ2487982

Authors: Yuan Hong, Xiao-Dong Zhang 

Publication date: 17 August 2005

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2005.04.001

Recommendations

• On the Laplacian spectral radius of a tree.
• Sharp lower bounds on the Laplacian eigenvalues of trees
• Bounds for the Laplacian spectral radius of graphs
• Bounding the largest eigenvalue of trees in terms of the largest vertex degree
• A sharp upper bound on the largest eigenvalue of the Laplacian matrix of a graph

zbMATH Keywords

Laplacian eigenvaluependant vertex

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Laplacian matrices of graphs: A survey
• On the spectral radius of graphs
• On the spectral radius of graphs with cut vertices
• On the Laplacian spectral radius of a tree.
• A sharp upper bound on the largest eigenvalue of the Laplacian matrix of a graph
• Spectral Radius and Degree Sequence
• Title not available (Why is that?)
• Bounds on eigenvalues and chromatic numbers

Cited In (only showing first 100 items - show all)

• On upper bounds for the energy of digraphs
• Title not available (Why is that?)
• Bounds for the extreme eigenvalues of the Laplacian and signless Laplacian of a graph
• A conjecture on the diameter and signless Laplacian index of graphs
• Bounds for the Laplacian spectral radius of graphs
• Bounds for the Laplacian spectral radius of graphs
• Some graft transformations and its applications on the distance spectral radius of a graph
• An explicit formula for eigenvalues of Bethe trees and upper bounds on the largest eigenvalue of any tree
• Some upper bounds for the energy of graphs
• On the Laplacian spectral radius of trees
• The Laplacian spectral radius of a graph under perturbation
• Minimizing the Laplacian eigenvalues for trees with given domination number
• Bounding the largest eigenvalue of trees in terms of the largest vertex degree
• The Laplacian spectral radius for unicyclic graphs with given independence number
• Stability of Woodall's theorem and spectral conditions for large cycles
• A note on upper bounds for the spectral radius of weighted graphs
• On a conjecture for the signless Laplacian spectral radius of cacti with given matching number
• The minimum signless Laplacian spectral radius of graphs with given independence number
• Note on the \(k\)th Laplacian eigenvalues of trees with perfect matchings
• Maximizing the signless Laplacian spectral radius of graphs with given diameter or cut vertices
• On the Laplacian spectral radius of weighted trees with a positive weight set
• On the weighted trees with given degree sequence and positive weight set
• The Laplacian spectral radius of some graphs
• Bounds and conjectures for the signless Laplacian index of graphs
• On the spectral radius of weighted trees with fixed diameter and weight set
• On the signless Laplacian spectral radius of graphs with cut vertices
• The Laplacian spectral radius of tricyclic graphs with \(n\) vertices and \(k\) pendant vertices
• Lower bounds on the (Laplacian) spectral radius of weighted graphs
• The smallest signless Laplacian spectral radius of graphs with a given clique number
• A bound on the spectral radius of graphs in terms of their Zagreb indices
• On the sum of powers of Laplacian eigenvalues of bipartite graphs
• The signless Laplacian spectral radius of graphs with given number of pendant vertices
• On the Laplacian spectral radii of bipartite graphs
• Bounds on the (Laplacian) spectral radius of graphs
• An edge-grafting theorem on Laplacian spectra of graphs and its application
• Sharp lower bounds on the Laplacian eigenvalues of trees
• Spectral analogues of Erdős' and Moon-Moser's theorems on Hamilton cycles
• Chromatic number and spectral radius
• Sharp upper bounds on the \(Q\)-index of (minimally) 2-connected graphs with given size
• Extremal Halin graphs with respect to the signless Laplacian spectra
• On the Laplacian spectral radius of a tree.
• Matrix power inequalities and the number of walks in graphs
• On the signless Laplacian index of cacti with a given number of pendant vertices
• On the signless Laplacian spectra of \(k\)-trees
• On the signless Laplacian index of unicyclic graphs with fixed diameter
• Maximizing the Laplacian spectral radii of graphs with given diameter
• Bounds for the (Laplacian) spectral radius of graphs with parameter \(\alpha \).
• On the sum of the Laplacian eigenvalues of a tree
• The Laplacian spectral radius of trees and maximum vertex degree
• On the Laplacian spectral radius of bipartite graphs with fixed order and size
• The Laplacian spectral radii of unicyclic and bicyclic graphs with \(n\) vertices and \(k\) pendant vertices
• Bounds on the eigenvalues of graphs with cut vertices or edges
• Walks and the spectral radius of graphs
• Sharp upper bounds for the Laplacian graph eigenvalues
• On sum of powers of the Laplacian eigenvalues of graphs
• On the Laplacian spectral radius of weighted trees with fixed diameter and weight set
• The least eigenvalue of the signless Laplacian of the complements of trees
• The signless Laplacian or adjacency spectral radius of bicyclic graphs with given number of cut edges
• On ordering bicyclic graphs with respect to the Laplacian spectral radius
• A characterization on graphs which achieve the upper bound for the largest Laplacian eigenvalue of graphs.
• Ordering trees with \(n\) vertices and matching number \(q\) by their largest Laplacian eigenvalues
• Minimizing the Laplacian spectral radius of trees with given matching number
• Laplacian spectral radius and maximum degree of trees with perfect matchings
• On the sum of powers of Laplacian eigenvalues of bipartite graphs
• On the \(k\)th largest eigenvalue of the Laplacian matrix of a graph
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the signless Laplacian index and radius of graphs
• The signless Laplacian spectral radius of tricyclic graphs and trees with \(k\) pendant vertices
• Inequalities for the number of walks in graphs
• On incidence energy of a graph
• Laplacian spectral radius of trees with given maximum degree
• On the Laplacian spectral radii of trees with perfect matchings
• On the Laplacian spectral radii of trees
• Sharp bounds on the signless Laplacian spread of graphs
• Upper bounds on the smallest positive eigenvalue of trees with at most one zero eigenvalue
• Maxima of the \(Q\)-index of non-bipartite graphs: forbidden short odd cycles
• The \(Q\)-index and connectivity of graphs
• On the spectral radius and the energy of a digraph
• The \(Q\)-minimizer graph with given independence number
• Spectral radius conditions for fractional \([a,b]\)-covered graphs
• Upper bounds on the smallest positive eigenvalue of trees
• Maxima of the \(Q\)-index of leaf-free graphs with given size
• Maxima of the Q ( L )-index of (minimally) 2-edge-connected graphs with given size
• Maximize the \(Q\)-index of graphs with fixed order and size
• Signless Laplacian spectral radius of graphs without short cycles or long cycles
• Sufficient spectral conditions for graphs being k-edge-Hamiltonian or k-Hamiltonian
• Measure-theoretic bounds on the spectral radius of graphs from walks
• On the spectral radius and energy of digraphs
• Extremal (balanced) blow-ups of trees with respect to the signless Laplacian index
• Maxima of the \(Q\)-spectral radius of \(C_3 (C_4)\)-free graphs with given size and minimum degree \(\delta \geq 2\)
• Answers to Gould's question concerning the existence of chorded cycles
• On the spectral radius of trees with given independence number
• Maxima of the \(Q\)-index of non-bipartite \(C_3\)-free graphs
• Energy of nonsingular graphs: improving lower bounds
• Maxima of the \(Q\)-index: graphs with no \(K_{1,t}\)-minor
• The spanning k-trees, perfect matchings and spectral radius of graphs
• Spectral sufficient conditions for graph factors containing any edge
• Bounds on the independence number and signless Laplacian index of graphs
• The effect on the adjacency and signless Laplacian spectral radii of uniform hypergraphs by grafting edges

This page was built for publication: Sharp upper and lower bounds for largest eigenvalue of the Laplacian matrices of trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2487982)