On the ordering of trees by the Laplacian coefficients
Aleksandar Ili\' c

TL;DR
This paper explores the partial ordering of trees based on Laplacian coefficients, identifying extremal trees, constructing chains of trees, and analyzing relationships among various classes of trees.
Contribution
It generalizes previous results on tree ordering by Laplacian coefficients, constructs long chains of trees, and characterizes orderings for starlike trees and trees with fixed properties.
Findings
Caterpillar trees have minimal Laplacian coefficients among fixed diameter trees.
Constructed chains of trees from stars to paths with ordered Laplacian coefficients.
Characterized partial orderings of starlike trees via majorization of pendent paths.
Abstract
We generalize the results from [X.-D. Zhang, X.-P. Lv, Y.-H. Chen, \textit{Ordering trees by the Laplacian coefficients}, Linear Algebra Appl. (2009), doi:10.1016/j.laa.2009.04.018] on the partial ordering of trees with given diameter. For two -vertex trees and , if holds for all Laplacian coefficients , , we say that is dominated by and write . We proved that among vertex trees with fixed diameter , the caterpillar has minimal Laplacian coefficients , . The number of incomparable pairs of trees on vertices is presented, as well as infinite families of examples for two other partial orderings of trees, recently proposed by Mohar. For every integer , we construct a chain of -vertex trees of length…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph theory and applications · Synthesis and Properties of Aromatic Compounds · Alzheimer's disease research and treatments
