The mean subtree order of a graph is the number of vertices of all subtrees of this graph divided by the number of all subtrees of this graph. In 2021, Cameron and Mol constructed a special graph of order
and proved that the addition of a single edge between a pair of nonadjacent vertices in the graph can decrease the mean subtree order by as much as
when
is large enough...