Counting trees of fixed defect for the adjacency eigenvalue one
Let m(T) be the multiplicity of the adjacency eigenvalue 1 in a tree T. For fixed D ≥ 3, 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 ⌊D/3⌋ vertices, and this bound is attained for every D. The count at order D + 2k is eventually quasipolynomial in k of exact degree ⌊D/3⌋ − 1 on every residue class, with a common leading coefficient determined by the automorphisms of the reduced trees.
Authors
- Zihuan Xu
Institutions
- Capital Normal University (CN)
Publication Details
- Journal
- Zenodo (CERN European Organization for Nuclear Research)
- Published
- 2026-11-19
- DOI
- https://doi.org/10.5281/zenodo.24365427
- Primary Topic
- Graph theory and applications
- Type
- preprint