1 Graph Nomenclature
Data structures and algorithms derived from graph theory form the basis for many network analysis techniques. A brief review of the most relevant aspects of computational graph theory follows. An excellent introduction to the subject is found in Aho, Hopcroft, and Ullman(1983) . Horowitz and Sahni (1978)  cover similar material in a more disjointed fashion. Even (1980)  provides a more theoretical examination of the subject.
The graph consists of a finite set of vertices and a finite set of edges .
Each edge corresponds to a pair of vertices. If edge corresponds to the vertex pair , then is incident upon vertices and . The number of vertices in is indicated by . The number of edges in is indicated by .
A labeling (or ordering) of the graph is a mapping of the set onto .
The usual convention for drawing a graph, is to represent each vertex as a dot and each edge as a line connecting two dots. If the graph is directed, an arrow is superimposed on each edge to show its orientation.