DISCM.MATH.2.E
Solve route inspection problems by Eulerizing a graph; October 2015 Update Page 25 §111.C. High School.
Discrete Mathematics for Problem Solving · Texas Essential Knowledge and Skills (TEKS) · TEKS 2012
Standard Unwrapping
AI-generated as a starting point — sign in to edit.Vocabulary
route inspection problemsEulerizinggraph
Skills
- solve (route inspection problems) #dok3
- Eulerize (a graph) #dok2
- analyze (the structure of graphs with respect to route inspection) #dok2
- apply (Eulerization to real-world scenarios) #dok3
Learning Targets
- I can recognize when a problem requires route inspection using a graph. #dok1
- I can describe the process of Eulerizing a graph for route inspection. #dok2
- I can modify a graph by adding edges to Eulerize it. #dok2
- I can solve a route inspection problem by finding an Eulerized graph. #dok3
- I can justify my solution to a route inspection problem by explaining my steps. #dok3
Big Ideas
- Many real-world problems involving routes, such as garbage collection or snow plowing, can be modeled and solved using graphs and Euler circuits.
- Eulerization is a method for modifying a graph to help efficiently solve route inspection problems when a given circuit does not exist.
Essential Questions
- What is a route inspection problem, and how can graphs be used to model such problems?
- How does Eulerizing a graph help solve route inspection problems?
- What steps are involved in finding a solution to a route inspection problem when an Euler circuit does not exist?
- In what ways can real-world scenarios be modeled as route inspection problems?
- How do we determine the minimum number of edge duplications needed to Eulerize a graph?