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
|
Complete matching |
If every member of X is paired with a member of Y |
|
|
Minumum spanning tree |
A spanning tree such that the total length of its arcs is as small as possible |
|
|
Connected vertices |
There is a path between them |
|
|
Complete graph |
A graph in which each of the 'n' vertices is connected to every other vertex |
|
|
Cycle (circuit) |
A closed path, i.e. the end vertex of the last edge is the start vertex of the first edge |
|
|
Subgraph |
Of G is a graph, each of whose vertices belongs to G and each of whose edges belongs to G |
|
|
Digraph |
The edges of a graph have a direction associated with them |
|
|
Connected graph |
All its vertices are connected |
|
|
Spanning tree |
A subgraph which includes all the vertices of G and is also a tree |
|
|
Tree |
A connected graph with no cycles |
|
|
Bipartite graph |
Two set of vertices X and Y. The edges only join vertices in X to vertices in Y, not vertices within a set |
|
|
Matching |
The pairing of some or all of the elements of one set, X, with elements of a second set, Y |
|
|
Weighted graph or network |
If a graph has a number associated with each badge |
|
|
Degree or valency |
The number of edges incident to a vertex |
|
|
Path |
A finite sequence of edges, such that the end vertex of one edge in the sequence is the start vertex of the next, and in which no vertex appears more than once |
|
|
Graph |
Consists of points (vertices or nodes) which are connected by lines (edges or arcs) |
