Edges may be removed from the graph that follows so that is becomes a spanning tree. Identify a set of edges that can be removed to accomplish this.

A) EF and EH
B) GH and FG
C) GH and HI
D) HI and FI

Question

Edges may be removed from the graph that follows so that is becomes a spanning tree. Identify a set of edges that can be removed to accomplish this.

A) EF and EH 
B) GH and FG 
C) GH and HI 
D) HI and FI

Quizplus · Accepted Answer

The Answer of Edges may be removed from the graph that follows so that is becomes a spanning tree. Identify a set of edges that can be removed to accomplish this.

A) EF and EH 
B) GH and FG 
C) GH and HI 
D) HI and FI

Edges May Be Removed from the Graph That Follows So