Question

For each undirected graph in Exercises 3-9 that is not simple, find a set of edges to remove to make it simple. Similarly, for each directed graph that is not a simple directed graph, find a set of edges to remove to make it a simple directed graph. 5. 8. 9.

Answer 1

solution
Sweǒ A simple. gyaph is gTaph which has no loops ard parallel edges Jf a graph in not stmple then we can make Simple b removt loops and parallel edges Since these are no loops parallel edges tn the graph the gven graph is sÎmpfe The graph ts not simple we have to semove hree edgesto 3 make if stmple.the edges are (a,b) (bd) (b,d) e3 3 the set of edges fo be Yemoved is qiven as

(6) 4 The graph ts not slmple The set of edges to be d Yemoved is given as(&2 the sit of edges to be Temoved to make it simple dts given ase,c) Cc,dl) (8) a The set of edges to be removed to make it simple o given asae),e,b)lb,o) lo The soh of edges to be C xemoved to make te Stmple is gfven as Thank You