Ordering trees with n vertices and matching number q by their largest Laplacian eigenvalues

@article{Guo2008OrderingTW,
  title={Ordering trees with n vertices and matching number q by their largest Laplacian eigenvalues},
  author={Shu-Guang Guo},
  journal={Discrete Mathematics},
  year={2008},
  volume={308},
  pages={4608-4615}
}
Denote by T"n","q the set of trees with n vertices and matching number q. Guo [On the Laplacian spectral radius of a tree, Linear Algebra Appl. 368 (2003) 379-385] gave the tree in T"n","q with the greatest value of the largest Laplacian eigenvalue. In this paper, we give another proof of this result. Using our method, we can go further beyond Guo by giving the tree in T"n","q with the second largest value of the largest Laplacian eigenvalue. 

Figures and Topics from this paper.

Explore Further: Topics Discussed in This Paper

References

Publications referenced by this paper.
SHOWING 1-10 OF 13 REFERENCES

On the Laplacian spectral radius of a tree

VIEW 13 EXCERPTS
HIGHLY INFLUENTIAL

The star is the tree with greatest Laplacian eigenvalue

I. Gutman
  • Kragujevac J. Math. 24
  • 2002
VIEW 1 EXCERPT

The two largest eigenvalues of Laplacian matrices of trees

X. D. Zhang, J. S. Li
  • J. China Univ. Sci. Technol. 28
  • 1998
VIEW 1 EXCERPT