Show that a cut set of a graph must have at least one edge
Chapter , Problem 26E(choose chapter or problem)
Show that a cut set of a graph must have at least one edge in common with any spanning tree of this graph.A cactus is a connected graph in which no edge is in more than one simple circuit not passing through any vertex other than its initial vertex more than once or its initial vertex other than at its terminal vertex (where two circuits that contain the same edges are not considered different).
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer