How many cut vertices are there in the graph?
because for any three vertices u, v, and w, if all paths from u to w in G pass through v, then the same must be true in T. Theorem 1 If G is a nontrivial connected graph of order n, then G has at most n - 2 cut vertices. Proof. Any tree of order n has at least two vertices that are not cut vertices,...