On the spectral moments of trees with a given bipartition
Shuchao Li, Jiajia Zhang

TL;DR
This paper characterizes the last four trees in spectral moment order within a specific class of bipartite trees, based on their spectral moments derived from adjacency matrix eigenvalues.
Contribution
It identifies the extremal trees in spectral moment order among bipartite trees with fixed bipartition sizes, extending understanding of spectral properties in tree structures.
Findings
Identifies the last four trees in spectral order within the class
Provides explicit characterization of these extremal trees
Enhances understanding of spectral properties in bipartite trees
Abstract
For two given positive integers and with , we denote \mathscr{T}_n^{p, q}={T: T is a tree of order with a -bipartition}. For a graph with vertices, let be its adjacency matrix with eigenvalues in non-increasing order. The number is called the th spectral moment of . Let be the sequence of spectral moments of . For two graphs and , one has if for some , and holds. In this paper, the last four trees, in the -order, among are characterized.
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 · Matrix Theory and Algorithms · Synthesis and Properties of Aromatic Compounds
