EXTREMAL WIENER INDICES OF TREES WITH PRESCRIBED FOREST FACTORS: UNIVERSAL CHAIN CONCENTRATION AND PARAMETRIC CORE OPTIMIZATION
We study the minimum and maximum Wiener indices of trees containing a fixedspanning forest, as posed by Lin. Every minimizer is a star of prescribed components centredat a largest component, with all bridges incident to minimum-transmission vertices. The mainmaximum theorem proves that all prescribed path components concentrate in one chain. If atleast two nonpath components are present, the chain connects two of them. An exact redistri-bution identity gives strictness and the equality cases. The maximum consequently reduces toa finite parametric optimization on the nonpath core and depends on the path components onlythrough their total order. We give explicit formulas for up to three nonpath components, anexact recurrence for arbitrary forests, and a subset-partition principle for the eventual expansionscore. For every sufficiently large total path order, all maximizing cores have a path quotient.An infinite family shows that even a perfectly balanced partition can lose to a split of ratio1 : 3. The one-nonpath case also characterizes the maximum for trees of fixed order containinga prescribed subtree.
Authors
- Tony Newton (ORCID: https://orcid.org/0009-0009-9189-6431)
Publication Details
- Journal
- Zenodo (CERN European Organization for Nuclear Research)
- Published
- 2026-11-20
- DOI
- https://doi.org/10.5281/zenodo.24397362
- Primary Topic
- Graph theory and applications
- Type
- preprint