SUO: *Date 01 Mar 2002 -- Graph Theory
¤~~~~~~~~~¤~~~~~~~~~¤~~~~~~~~~¤~~~~~~~~~¤~~~~~~~~~¤
Graph Theory
| A 'graph' G consists of a finite nonempty set V = V(G) of p 'points'
| together with a prescribed set X of q unordered pairs of distinct points
| of V. Each pair x = {u, v} of points in X is a 'line' of G, and x is said
| to 'join' u and v. We write x = uv and say that u and v are 'adjacent points'
| (sometimes denoted 'u adj v'); point u and line x are 'incident' with each other,
| as are v and x. If two distinct lines x and y are incident with a common point,
| then they are 'adjacent lines'. A graph with p points and q lines is called
| a '(p, q) graph'. The (1, 0) graph is 'trivial'.
|
| Harary, 'Graph Theory', page 9.
Et sic deinceps, it goes on from there ...
Jon Awbrey
¤~~~~~~~~~¤~~~~~~~~~¤~~~~~~~~~¤~~~~~~~~~¤~~~~~~~~~¤
Select Bibliography
Elementary Graph Theory:
| Frank Harary,
|'Graph Theory',
| Addison-Wesley, Reading, MA, 1969.
Enumerative Graph Theory:
| Frank Harary & Edgar M. Palmer,
|'Graphical Enumeration',
| Academic Press, New York, NY, 1973.
Asymptotic Graph Theory:
| Edgar M. Palmer,
|'Graphical Evolution: An Introduction to the Theory of Random Graphs',
| John Wiley & Sons, New York, NY, 1985.
Algorithmic Graph Theory:
| Shimon Even,
|'Graph Algorithms',
| Computer Science Press, Rockville, MD, 1979.
¤~~~~~~~~~¤~~~~~~~~~¤~~~~~~~~~¤~~~~~~~~~¤~~~~~~~~~¤