Alabama Math FM.N.A.18.b
The Standard
- FM.N.A
- Complex problems can be modeled using vertex and edge graphs and characteristics of the different structures are used to find solutions.
- FM.N.A.18
- Apply algorithms relating to minimum weight spanning trees, networks, flows, and Steiner trees.
Show that every connected graph has a minimal spanning tree.
2019 Alabama Course of Study: Mathematics · Complex problems can be modeled using vertex and edge graphs and characteristics of the different structures are used to find solutions.
Teacher's field guide
What This Standard Means
What Students Need to Do
- Start with a connected graph. Remove one edge from a cycle at a time until no cycles remain. Explain why the graph stays connected and why the process ends for any finite graph.
What Mastery Looks Like
- A student can cross out cycle edges to make a tree that includes every vertex. They can explain that each removed edge has an alternate route, and removing any edge from the finished tree would break a connection.
Common Misconceptions
- Students may remove an edge that is not part of a cycle and disconnect the graph. They may think the tree needs the shortest edges, even when no edge lengths are given.
How to Assess It
- Exit ticket: Draw vertices A, B, C, D with edges AB, BC, CD, DA, and AC. Cross out edges to make a tree, then explain why removing a cycle edge always keeps a connected graph connected.
Lesson moves
Ways to Teach It
Connect six labeled cards with yarn in a ring plus two chords; have students remove cycle edges until the cards form a tree.
Ask pairs to write two sentences answering: Why does cutting one edge from a cycle leave every vertex reachable?
Give pairs edges AB, BC, CD, DE, EA, and AC; have them race to cross out two edges while keeping every vertex connected.
Draw five school buildings with paths forming a ring and one shortcut; choose the fewest paths to maintain while keeping every building reachable.
Free download
Printable FM.N.A.18.b Worksheet

A ready-to-print activity worksheet aligned to FM.N.A.18.b, with an answer key for the teacher on its own page. No account needed.
PDF, US Letter, prints cleanly in black and white.
Download the worksheetKeep exploring
Related Standards
- FM.N.A.18.c
Use Kruskal's Algorithm and Prim's Algorithm to determine the minimal spanning tree of a weighted graph.
- FM.N.A.18
Apply algorithms relating to minimum weight spanning trees, networks, flows, and Steiner trees.
- FM.N.A.16.a
Identify properties of simple graphs, complete graphs, bipartite graphs, complete bipartite graphs, and trees.
- FM.N.A.17.b
Give an argument for graph properties.
Turn this exact standard into a lesson
Grade, subject, topic, and the complete standard are prefilled. Create one free, no account needed.
Also for this standard:Make a WorksheetMake a QuizMake a Sub Lesson