Ordering trees by the spectral radius of Laplacian
Tan, Jinsong
Proc. Japan Acad. Ser. A Math. Sci., Tome 75 (1999) no. 10, p. 188-193 / Harvested from Project Euclid
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.
Publié le : 1999-12-14
Classification:  Ordering trees,  adjacency operator,  combinatorial Laplacian,  partial ordering,  05C05,  05C50
@article{1148393795,
     author = {Tan, Jinsong},
     title = {Ordering trees by the spectral radius of Laplacian},
     journal = {Proc. Japan Acad. Ser. A Math. Sci.},
     volume = {75},
     number = {10},
     year = {1999},
     pages = { 188-193},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1148393795}
}
Tan, Jinsong. Ordering trees by the spectral radius of Laplacian. Proc. Japan Acad. Ser. A Math. Sci., Tome 75 (1999) no. 10, pp.  188-193. http://gdmltest.u-ga.fr/item/1148393795/