Step 1 of 8 · Worked example · TEACH
0 of 3 done
Work through the example to CHECK to open the problems.
Reach CHECK to open the problems.Ordinary Level · Applied Maths · Algorithms, Optimisation & Project Scheduling · Step 1Follow the worked example and explain why each modelling and calculation step is valid.
A simple undirected graph has vertices A,B,C,D and exactly edges AB, BC, CD. Is it a spanning tree? Explain.
An undirected graph has vertices A, B, C and D. Its only edges are AB, BC and CD.
Is it a spanning tree? Explain.
Ordinary Level Applied Maths · Algorithms, Optimisation & Project Scheduling · Step 1 of 8
A tree is connected and has no cycles, and a spanning tree connects every vertex of the original graph.
Spanning trees let you remove unnecessary network links while keeping every vertex reachable.
An undirected graph has vertices A, B, C and D. Its only edges are AB, BC and CD. Is it a spanning tree? Explain.