Leaf to leaf path lengths in trees of given degree sequence
Discrete Mathematics · 2026-09 · 349 (9) · 115086
DOI: 10.1016/j.disc.2026.115086 ↗Kurz gefasst
Fachartikel in der Zeitschrift Discrete Mathematics, 2026-09. Verfasst von Dieter Rautenbach und 2 weiteren Autor:innen. Die Arbeit nennt 4 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
For a tree $T$, let $lp(T)$ be the number of different lengths of leaf to leaf paths in $T$. For a degree sequence $s$ of a tree, let ${\rm rad}(s)$ be the minimum radius of a tree with degree sequence $s$. Recently, Di Braccio, Katsamaktsis, and Malekshahian provided a lower bound on $lp(T)$ in terms of the number of leaves and the maximum degree of $T$, answering a related question posed by Narins, Pokrovskiy, and Szab\'o. Here we show $lp(T)\geq {\rm rad}(s)-\log_2\left({\rm rad}(s)\right)$ for a tree $T$ with no vertex of degree $2$ and degree sequence $s$, and discuss possible improvements and variants.
Zitieren
APA
Rautenbach, D., Scherer, J., & Werner, F. (2026). Leaf to leaf path lengths in trees of given degree sequence. Discrete Mathematics, 349(9), 115086. https://doi.org/10.1016/j.disc.2026.115086
Vancouver
Rautenbach D, Scherer J, Werner F. Leaf to leaf path lengths in trees of given degree sequence. Discrete Mathematics. 2026;349(9):115086. doi:10.1016/j.disc.2026.115086
BibTeX
@article{Rautenbach2026,
author = {Rautenbach, Dieter and Scherer, Johannes and Werner, Florian},
title = {Leaf to leaf path lengths in trees of given degree sequence},
journal = {Discrete Mathematics},
year = {2026},
volume = {349},
number = {9},
pages = {115086},
doi = {10.1016/j.disc.2026.115086}
}
EUVIMED