Spanning Trees with Many Leaves and Average Distance by DeLaViña, Waller

https://www.doi.org/10.37236/757

@article{spanningTreesManyLeaves2008,
author = {DeLaViña, Ermelinda and Waller, Bill},
copyright = {Copyright (c)},
doi = {10.37236/757},
issn = {1077-8926},
journaltitle = {The Electronic Journal of Combinatorics},
language = {en},
month = {February},
pages = {R33--R33},
title = {Spanning Trees with Many Leaves and Average Distance},
year = {2008},
}

page 5 : average distance upper bounds bipartite number by a linear function – Theorem 9 (Main Theorem). Let $G$ be a graph. Then $\bar{D} < \frac b2 + \frac 12$. …