Improved upper bounds on the minimum average distance μ(T) of spanning trees T: μ(T) < α + 1 for α ≥ 1, and μ(T) < α + 1/2 + 4(α-1)/α² for α ≥ 7.
Shi, The average distance of trees, System Sci
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
The average distance of spanning trees in terms of independence number
Improved upper bounds on the minimum average distance μ(T) of spanning trees T: μ(T) < α + 1 for α ≥ 1, and μ(T) < α + 1/2 + 4(α-1)/α² for α ≥ 7.