| Term | Definition |
|---|
| graph | type of diagram |
| graph theory | the study of representing places as vertices and the lines between them as paths |
| gantt chart | a graphical representation of the duration of tasks against the progression of time |
| vertices | points on a graph that represent a place or location |
| edges | lines on a graph that represent a path |
| prerequisite | this must occur before the next task can be started |
| parallel activities | tasks that can be occurring at the same time |
| EST | the earliest that an activity can begin if all activities proceeding it begin as early as possible |
| critical path | calculation of the minimum length of time in which the project can be completed |
| connected graph | a graph where there is a path linking all the vertices together |
| adjacent | two vertices are this when there is an edge connecting them |
| complete graph | a graph where every pair of vertices are adjacent |
| degree (valence) | the number of edges connected to a vertex |
| cycle | a path through a graph that begins and ends at the same vertex, only repeating the initial vertex |
| tree | a connected graph with no cycles |
| digraph | a graph whose edges have direction |
| indegree | the number of edges going in to a vertex |
| outdegree | the number of edges going out of a vertex |
| adjacency matrix | represents a connected pair with a 1 and an unconnected pair with a 0 |
| Euler circuit | a path that uses each edge of a graph once and ends at the starting vertex |
| Euler path | a path that uses each edge once, but ends at a vertex different from the starting vertex |
| even | an Euler circuit exists if the degree of each vertex is... |
| odd | an Euler path exists if two vertices have _____ degrees |
| Hamiltonian circuit | a path that visits each vertex of a graph once and ends at the starting vertex |
| Hamiltonian path | a path that visits each vertex of a graph once, but ends at a vertex different from the starting vertex |
| tournament | a complete graph with directed edges |
| transmitter | a vertex with a positive outdegree and a zero indegree |
| receiver | a vertex with a positive indegree and a zero outdegree |
| chromatic number | the minimum number of colors needed to assign a color to each vertex so that no adjacent vertices have the same color |
| scheduling | an application of graph coloring |
| planar graph | a graph that can be drawn without any pair of edges intersecting except at the vertices |
| bipartite graph | a graph with vertices can be divided into 2 distinct sets so that each edge of the graph has one vertex in each set |
Combine with other sets
Share on Facebook
Share on MySpace
does anyone want to go to the gym this sat. on area 1 around 10?