title: How many Minimum Height Trees (MHTs) can a graph have at most?
body: <p>For an undirected graph with tree characteristics, we can choose any node as the root. The result graph is then a rooted tree. Among all possible rooted trees, those with minimum height are called minimum height trees (MHTs). How many MHTs can a graph have at most?</p>