Question: Let G = (V, E) be a loop-free connected undirected graph. Let H be a subgraph of G. The complement of H in G is

Let G = (V, E) be a loop-free connected undirected graph. Let H be a subgraph of G. The complement of H in G is the subgraph of G made up of those edges in G that are not in H (along with the vertices incident to these edges).
(a) If T is a spanning tree of G, prove that the complement of T in G does not contain a cut-set of G.
(b) If C is a cut-set of G, prove that the complement of C in G does not contain a spanning tree of G.

Step by Step Solution

3.31 Rating (160 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

a If the complement of T contains a cut set then the removal of these edges disconnec... View full answer

blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Document Format (1 attachment)

Word file Icon

954-M-L-A-L-S (8250).docx

120 KBs Word File

Students Have Also Explored These Related Linear Algebra Questions!