Chromatic Symmetric Reconstruction of Proper Trees with Leaf-Observed Repeated-Weight Cores
We give a constructive chromatic-symmetric reconstruction criterion for proper trees whose weighted skeleton has an arbitrarily large connected core of repeated equal-weight vertices. Outside this core, every skeleton weight is unique. We assume that each peripheral whole-branch attachment has a mass isolated among peripheral edge-detachment masses, that every peripheral detached mass is smaller than the common core weight, and that every leaf of the core carries an identifiable attachment; internal core vertices need not be observed. The first power-sum derivative recovers skeleton weight multiplicities and edge-type counts using an existing theorem of Awan. Coefficients corresponding to cuts with two, three, or four weighted components provide quadratic moments whose mixed differences determine distances between tagged core sites. The tagged sites span the core, so classical additive-tree-metric reconstruction recovers intervening vertices. Known recognition results extend the conclusion from proper-tree competitors to all finite simple graphs. An explicit 69-vertex example has an unobserved, nonpath core. The result is a sufficient reconstruction criterion for a restricted infinite class of trees, not a resolution of Stanley’s unrestricted tree-isomorphism conjecture.
Authors
- Casey Atwell
Publication Details
- Journal
- Zenodo (CERN European Organization for Nuclear Research)
- Published
- 2026-11-12
- DOI
- https://doi.org/10.5281/zenodo.24163711
- Primary Topic
- Advanced Combinatorial Mathematics
- Type
- preprint