Open Access
Dec. 1999 Ordering trees by the spectral radius of Laplacian
Jinsong Tan
Proc. Japan Acad. Ser. A Math. Sci. 75(10): 188-193 (Dec. 1999). DOI: 10.3792/pjaa.75.188

Abstract

We study the spectrum of Laplacian for trees, and make an approach to ordering trees by the spectral radius of Laplacian. A general method of ordering trees is derived as well, and as its applications, we give the optimal estimates of the orderings of two types of trees.

Citation

Download Citation

Jinsong Tan. "Ordering trees by the spectral radius of Laplacian." Proc. Japan Acad. Ser. A Math. Sci. 75 (10) 188 - 193, Dec. 1999. https://doi.org/10.3792/pjaa.75.188

Information

Published: Dec. 1999
First available in Project Euclid: 23 May 2006

zbMATH: 0953.05047
MathSciNet: MR1740641
Digital Object Identifier: 10.3792/pjaa.75.188

Subjects:
Primary: 05C05 , 05C50

Keywords: adjacency operator , combinatorial Laplacian , Ordering trees , partial ordering

Rights: Copyright © 1999 The Japan Academy

Vol.75 • No. 10 • Dec. 1999
Back to Top