Term
|
Definition
| All possible values for X |
|
|
Term
|
Definition
|
|
Term
|
Definition
|
|
Term
|
Definition
| Every X goes to a unique Y |
|
|
Term
|
Definition
Every Y is used (*range = co-domain) |
|
|
Term
|
Definition
| Consists of a finite set of vertices (nodes) and a finite set of edges (lines) connecting them. |
|
|
Term
| Directed Graph (Di-Graph) |
|
Definition
| A graph where each edge is associates with an ordered pair of vertices (nodes) |
|
|
Term
|
Definition
| A graph that does not have any loops or parallel edges |
|
|
Term
|
Definition
| A simple graph where every vertex (node) is connected to every vertex |
|
|
Term
|
Definition
|
|
Term
|
Definition
| The number of edgtes that connect to it (a loop counts twice) |
|
|
Term
| Total degree of the graph |
|
Definition
| The sum of the degree of the vertices |
|
|
Term
|
Definition
| In any graph, there is an even number of vertices with an odd number of degrees |
|
|
Term
|
Definition
| Teavel from one vertex to another; may repeat |
|
|
Term
|
Definition
| Walk that starts and ends at the same vertex |
|
|
Term
|
Definition
| Walk that doesn't repeat any edges |
|
|
Term
|
Definition
| A path that does not repeat vertices |
|
|
Term
|
Definition
| A closed walk that does not repeat edges |
|
|
Term
|
Definition
| A circut that does not repeat vertices (except @ start / end) |
|
|
Term
|
Definition
Has 1's down the diagnol; 0's everywhere else. |1 0 0| |0 1 0|
|0 0 1| |
|
|
Term
|
Definition
Connected graph with: *No circuts *No isolated vertices |
|
|
Term
|
Definition
|
|
Term
|
Definition
|
|
Term
|
Definition
|
|
Term
|
Definition
| A vertex from which all others "hang" (identified starting area |
|
|
Term
|
Definition
| An adjacent node below the node (vertex) of interest |
|
|
Term
|
Definition
| The adjacent node above the vertex (node) of interest |
|
|
Term
|
Definition
| All vertices directly below the vertex of interest |
|
|
Term
|
Definition
| A rooted tree where each vertex has at most 2 children |
|
|
Term
|
Definition
| Every internal vertex (including the root) has exactly 2 children (no 1 child) |
|
|
Term
|
Definition
a subgraph that contains every vertex in the original connected graph (Make a tree out of a graph) |
|
|
Term
|
Definition
| A spanning tree with the least total (weight/cost); Needs weights associated with it |
|
|
Term
|
Definition
| Tells how many edges go from one vertex to another |
|
|
Term
|
Definition
| Given m pigeonholes and n pigeons when n > m, then one pigeonhole must have at least two pigeons. |
|
|
Term
|
Definition
| The result of one function can be the input of a second function |
|
|
Term
|
Definition
| An association between data terms |
|
|
Term
|
Definition
| The number of elements in a set |
|
|
