Question: Let G be a graph on 3 vertices, each connected to the other 2 by an edge, and such that each edge has weight 1
Let G be a graph on vertices, each connected to the other by an edge,
and such that each edge has weight Since every edge has the same weight,
every edge is a light edge for a cut which it spans. However, if we take all edges
we get a cycle
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
