Question

For a connected simple undirected graph, a spanning tree T is called a blocking spanning
tree, if for all spanning trees T' (including T itself), T and T' share at least one edge in
common.
a. Any spanning tree that uses every edge incident to some vertex is a blocking spanning
tree. True or False? Justify your answer.
b. Any connected simple undirected graph has at least one blocking spanning tree. True
or False? Justify your answer.

Answer 1

Answer:

please follow me and solve my question answer