SOL Prep

Graph Theory

Virginia SOL DM.GT.2

Solve problems using circuits, cycles, Euler paths, Euler circuits, Hamilton paths, and Hamilton circuits.

Study DM.GT.2 with SOL PrepBack to Discrete Mathematics

What students need to be able to do

  • Determine whether a graph has an Euler circuit or path and identify it if it exists.
  • Determine whether a graph has a Hamilton circuit or path and identify it if it exists.
  • Count the number of Hamilton circuits for a complete graph with n vertices.
  • Use an Euler circuit algorithm to solve optimization problems.