Give a simple example of a connected graph such that an edge (u, v) is a light edge for some cut, but there exists a minimum spanning tree that does not contain (u, v).

Linear Algebra: A Modern Introduction
4th Edition
ISBN:9781285463247
Author:David Poole
Publisher:David Poole
Chapter3: Matrices
Section3.7: Applications
Problem 80EQ
icon
Related questions
Question

Give a simple example of a connected graph such that an edge (u, v) is a light edge for some cut, but there exists a minimum spanning tree that does not contain (u, v).

Expert Solution
steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Tree
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, advanced-math and related others by exploring similar questions and additional content below.
Recommended textbooks for you
Linear Algebra: A Modern Introduction
Linear Algebra: A Modern Introduction
Algebra
ISBN:
9781285463247
Author:
David Poole
Publisher:
Cengage Learning