Alabama Math FM.N.A.17
Standard Cluster
- FM.N.A
- Complex problems can be modeled using vertex and edge graphs and characteristics of the different structures are used to find solutions.
Solve problems involving networks through investigation and application of existence and nonexistence of Euler paths, Euler circuits, Hamilton paths, and Hamilton circuits. a. Develop optimal solutions of application-based problems using existing and student-created algorithms. b. Give an argument for graph properties.
2019 Alabama Course of Study: Mathematics
Cluster contents
Standards in This Cluster
FM.N.A.17 is a cluster heading. These are the individual standards under it.
Teacher's field guide
What This Cluster Means
What Students Need to Do
- Students find routes that use every edge once or visit every vertex once. They check whether a route can return to its start and explain when a route is impossible. On small maps, they test their own route-finding rules to find the shortest valid route.
What Mastery Looks Like
- A student uses the number of odd-degree vertices to decide whether a connected network has an edge-once path or circuit. They draw a vertex-once route when one exists and explain why one is blocked when it does not. They compare possible routes on a small map to verify which is shortest.
Common Misconceptions
- Students may confuse using every edge with visiting every vertex. They may think returning to the start is allowed in any path, or assume a connected network always has an edge-once route. Some use the odd-degree rule to judge vertex-once routes, where it does not apply.
How to Assess It
- Draw a square with one diagonal. Ask students to find an edge-once route, decide whether it can end where it starts, and explain their answer using vertex degrees.
Lesson moves
Ways to Teach It
Use six index cards and string to make a hexagon with one chord; find an edge-once path and a vertex-once circuit.
Show a network with four odd-degree vertices and ask, "Why can't you use every edge once without retracing?"
Give teams a five-stop travel-time table; invent a route-finding rule, then check every round trip to see whether it finds the shortest.
Give students a 2-by-2 street grid with block lengths; plan the shortest street-sweeper loop covering every street.
Free download
Printable FM.N.A.17 Worksheet

A ready-to-print activity worksheet aligned to FM.N.A.17, 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.16
Use vertex and edge graphs to model mathematical situations involving networks.
- FM.R.A.11
Find patterns in application problems involving series and sequences, and develop recursive and explicit formulas as models to understand and describe sequentia...
- FM.N.A
Complex problems can be modeled using vertex and edge graphs and characteristics of the different structures are used to find solutions.
- PC.F.E.32
Solve application-based problems involving parametric and polar equations.
Turn this cluster into a lesson
Grade, subject, topic, and the complete cluster are prefilled. Create one free, no account needed.
Also for this cluster:Make a WorksheetMake a QuizMake a Sub Lesson