Decreasing the mean subtree order by adding $k$ edges

Stijn Cambie, Guantao Chen, Yanli Hao +1

The mean subtree order of a given graph $G$, denoted $\mu (G)$, is the average number of vertices in a subtree of $G$. Let $G$ be a connected graph. Chin, Gordon, MacPhee, and Vincent…