On the mean subtree order of graphs under edge addition
On the mean subtree order of graphs under edge addition
Abstract For a graph , the mean subtree order of is the average order of a subtree of . In this note, we provide counterexamples to a recent conjecture of Chin, Gordon, MacPhee, and Vincent, that for every connected graph and every pair of distinct vertices and of , the …