If you remove an edge (u, v) from an MST T, the two resulting sub-trees
Aare themselves MSTs of their induced subgraphs
Bare no longer trees of any kind
Cmust share at least one vertex to remain connected
Dalways have equal total weight
Answer & Solution
Correct answer: A. are themselves MSTs of their induced subgraphs
Removing one edge from a tree gives two sub-trees on disjoint vertex sets. The MST's optimal substructure says each sub-tree is itself an MST of its induced subgraph (proven by a cut-and-paste exchange argument). Without this property, greedy MST construction would not work.
Related questions
An NP-hard problem differs from an NP-complete one because NP-hard problemsThe first problem proved to be NP-complete wasA problem X is NP-complete if and only ifWhy does theoretical computer science draw the line at 'polynomial-time' for tractability?Which set inclusion is established (i.e., proven, not open)?The class NP is the set of decision problems for whichFloyd-Warshall detects the presence of a negative cycle byTopological sort is well-defined for