Deleting an edge from the connected graph can never ever result in a graph which includes greater than two linked factors.A list of edges in the graph G is said to generally be an edge Slice set if its removing can make G, a disconnected graph. Put simply, the list of edges whose elimination will raise the amount of components of G.Children beneath