See what we can offer to your school
"SimpleStudy just makes sense...”
Get the best plan for your school
12 questions from this quiz
Vertices and nodes
Number of edges meeting at it
Numerical values assigned to edges
Facebook friendships
All edges in it must exist in original
No loops, at most one edge per pair
An edge connecting a vertex to itself
Paths never revisit any vertex
A closed path starting and ending same
When there's a path between every pair
Connected with no cycles
Sum of degrees equals twice the edges
Select your subjects, and get access to A+ resources today.