Busy. Please wait.

show password
Forgot Password?

Don't have an account?  Sign up 

Username is available taken
show password


Make sure to remember your password. If you forget it there is no way for StudyStack to send you a reset link. You would need to create a new account.
We do not share your email address with others. It is only used to allow you to reset your password. For details read our Privacy Policy and Terms of Service.

Already a StudyStack user? Log In

Reset Password
Enter the associated with your account, and we'll email you a link to reset your password.
Don't know
remaining cards
To flip the current card, click it or press the Spacebar key.  To move the current card to one of the three colored boxes, click on the box.  You may also press the UP ARROW key to move the card to the "Know" box, the DOWN ARROW key to move the card to the "Don't know" box, or the RIGHT ARROW key to move the card to the Remaining box.  You may also click on the card displayed in any of the three boxes to bring that card back to the center.

Pass complete!

"Know" box contains:
Time elapsed:
restart all cards
Embed Code - If you would like this activity on your web page, copy the script below and paste it into your web page.

  Normal Size     Small Size show me how

D1 Graphs & Networks


Graph Vertices (nodes) which are connected by edges (arcs)
Subgraph Part of a graph
Degree / Valency Number of edges incident to a vertex
Path A finite sequence of edges, in which no vertex appears more than once
Walk Like a path, but you can return to vertices
Cycle A closed path
Loop Starts a finishes at the same node
Simple graph A graph with no loops and not more than one edge connecting any pair of vertices
Digraph Graph with directed edges
Tree A connected graph with no cycles
Spanning Tree Subgraph including every vertex
Bipartite graph Two sets of vertices with edges joining between the sets
Complete graph Every vertex connected to every other vertex
Isomorphic graphs Different graphs showing the same information
Eulerian graph Connected graph with no odd nodes
Semi-Eulerian graph Connected graph with just one pair of odd vertices
Created by: abivdl