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;
12 Cards in this Set
- Front
- Back
|
Simple graph |
A graph which has no loops and not more than one edge connecting each pair of vertices |
|
|
Directed edges |
Edges that have a direction associated with them |
|
|
Graph with directed edges is known as a |
Digraph |
|
|
Tree |
Connected graph with no cycles |
|
|
Spanning tree of a graph (G) |
A subgraph which includes all the vertices of G and its also a tree |
|
|
Bipartite graph |
A graph that consists of two sets of vertices X and Y. The edges only join vertices in X to vertices in Y, not vertices within a set. |
|
|
Complete graph |
A graph in which every vertex is directly connected by an edge to each of the other vertices (If graph has n vertices, graph is denoted Kn. |
|
|
Complete bipartite graph is denoted... |
Kr,s |
|
|
A complete bipartite graph is a graph in which... |
there are r vertices in set X and s vertices in set Y |
|
|
What do isomorphic graphs show and how are they different? |
Exact same information but are drawn differently. |
|
|
What does an adjacency matrix record? |
The number of direct links between vertices |
|
|
What does a distance matrix record? |
Weights on the edges (When there is no weight, this is shown by '-') |
