A _____ consists of points which are connected by lines

A _____ of G is a graph, each of whose vertices belong to G and each of whose edges belong to G.

If a graph has a number associated with each edge then the number is normally called this.

The ____ of a vertex is the number of edged incident to it.

A _____ is 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.

A closed path such that the end vertex of the last edge is the start vertex of the first edge.

If every vertex is connected then you have one of these.

A graph where the edges have a direction associated with them.

A connected graph with no cycles.

A ___ of graph G is a subgraph which includes all the vertices of G and is also a tree.

This is a spanning tree such that the total length of its arcs is as small as possible.

A graph in which each of the n vertices is connected to every other is called this.

F(i, j) = lj - ei - duration (i, j) where ei is the earliest time for event i and lj is the latest time for event j.

This 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.

This is the pairing of some or all of the elements of one set X with a second set Y.

If every member of X is paired with a member of Y then it is said to be a ______

If the edges of a graph have a direction associated with them then they are known as this.

Two vertices are ______ if there is a path between them.

## Show Comments