Work

Counting trees of fixed defect for the adjacency eigenvalue one

Year: 2026
Type: preprint
Abstract: Let \(m(T)\) be the multiplicity of the adjacency eigenvalue \(1\) in a tree \(T\). For fixed \(D\ge3\), we count unlabelled trees with \(|T|-2m(T)=D\). Pruning repeated pendant paths of length two produces a canonical tree on at most \(3D\) vertices. All expansions of a given tree are counted by a cycle index on at most \(\lfloor D/3\rfloor\) vertices, and this bound is attained for every \(D\). The count at order \(D+2k\) is eventually quasipolynomial in \(k\) of exact degree \(\lfloor D/3\rfloor-1\) on every residue class, with a common leading coefficient determined by the automorphisms of the reduced trees.
Author: Xu, Zihuan
Language: English
Open Access status: green
OpenAlex ID: W7236759271
Cites:
Cited by:
Related to: 10