Busy. Please wait.
or

show password
Forgot Password?

Don't have an account?  Sign up 
or

Username is available taken
show password

why


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.

Remove ads
Don't know
Know
remaining cards
Save
0:01
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:
Retries:
restart all cards




share
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

AQA COMP3 Graphs

Definitions about General graph theory not in the Textbook

TermDefinition
Graph A finite, discrete set of vertices linked by edges
Tree A connected, undirected graph with no cycles
Rooted tree A tree where one vertex is the starting point, and all points use this as a ‘root’
Directed graph A graph where each edge has a direction (shown by an arrow)
Vertex A point where two edges connect
Edge A line connecting two vertices
Neighbours Adjacent vertices to a vertex
Degree (of a vertex) The number of edges connected to a vertex
Weighted graph A graph where each edge has been given a weight
Simple graph A graph where there are no loops, and no more than 1 edge per vertex. Each edge connects two different vertices.
Path A route that does not have to visit all edges
Circuit A succession of edges that start and end at the same vertex
Cycle A closed path where all the edges and intermediate vertices are different
Undirected graph A graph with no direction (ie an edge can be traversed either way)
Explorer’s problem The solution finds a route that traverses each ‘road’ (edge) exactly once before returning to the start point
Traveller’s problem The solution finds a route that visits each ‘city’ (vertex) exactly once before returning to the start point
Created by: joemch