See what we can offer to your school
"SimpleStudy just makes sense...”
Get the best plan for your school
10 cards from this deck
Sequence of edges connecting vertices; can repeat edges & vertices
Walk where no edge is repeated; vertices may repeat
Walk with no repeated edges or vertices
Trail that starts and ends at same vertex (closed trail)
Path that starts and ends at same vertex (closed path)
Circuit can repeat vertices; cycle cannot (except start/end)
Follows every edge of connected graph exactly once
Connected graph with exactly 0 or 2 odd-degree vertices
Connected graph where all vertices have even degree
Eulerian refers to edges; Hamiltonian refers to vertices
Show more
Select your subjects, and get access to A+ resources today.