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.

By signing up, I agree to StudyStack's Terms of Service and Privacy Policy.

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.

Remove ads
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 Definitions

Graph Definitions

Graph a set of vertices (or nodes) together with a set of edges
Edge a line with a vertex at each end
Loop an edge with the same vertex at each end
Degree (or Order) of a Vertex the number of edges incident on it
Simple Graph a graph where there are no loops, and in which there is no more than one edge connecting any pair of vertices
Walk a sequence of edges in which the end of one edge (except the last) is the beginning of the next
Trail a walk where no edge is repeated
Path a trail where no vertex is repeated
Cycle a closed path
Hamiltonian Cycle a cycle which visits every vertex
When is a graph connected? if a path exists between every pair of vertices
Tree a simple connected graph with no cycles
Digraph (directed graph) a graph is which at least one edge has a direction associated with it
Complete graph a simple graph in which every pair of vertices is connected by an edge
Incidence Matrix a way of representing a graph by a matrix
Isomorphic Graphs Two graphs are isomorphic if one can be stretched, twisted or otherwise distorted into each other
Planar Graph a graph which can be drawn without any edges crossing
Bipartite Graph a graph in which the vertices fall into two sets and in which each edge has a vertex from one set at one end and from the other set at its other end
Created by: Masterniket