Use LEFT and RIGHT arrow keys to navigate between flashcards;
Use UP and DOWN arrow keys to flip the card;
H to show hint;
A reads text to speech;
16 Cards in this Set
- Front
- Back
Arcs |
The lines they must always join at least one dot |
|
Edge |
The lines they must always join at least one dot |
|
Trees |
Have no cycles and are simple every dot must be joined by at least one other dot |
|
Simple |
No loops or multiple arcs |
|
Cycles |
A circular route that starts and ends in the scale place |
|
Loops |
A arc that starts and ends on the same vertex |
|
Multiple edges |
Two or more arcs that start and end on the same node |
|
Order/degree |
The number of arcs that come into a vertex |
|
Complete graph |
Every dot joined to every other dot |
|
Connected graph |
Every dot joined by every other dot |
|
Planer graph |
A graph that can be drawn with no lines crossing |
|
Hamilton cycle |
A route that goes to every vertex only once except the first vertex which must also be the end vertex |
|
Walk |
A route with no gaps |
|
Trail |
A walk but no arc is included more than once |
|
Bipartite graph |
The vertices can be divided into two groups and no longer joins any two vertices in the same group |
|
Digraph |
A graph that has at least one direction |