- SCA190-GA165-4-75
- File
- [January 1960?]-[1975?]
Part of Dr. Donald D. Cowan fonds.
Research materials created and accumulated by Donald Cowan related to graphs and network research. Includes notes and diagrams as well as one letter and attachment from Frank Allaire, University of Manitoba, to Donald Cowan regarding a project on the maximal number of disjoint circuits of a graph. Also contains copies of the following articles and papers:
-
1. Tutte, W.T. (January 1960). A non-hamilton graph. Canadian Math Bulletin, volume 3, (number 1), pages 1-5.
-
2. Hoffman, A.J. and R.R. Singleton. (November 1960). On Moore graphics with diameters 2 and 3. IBM Journal.
-
3. Liu, C.L. (January 1, 1972). Topics in combinatorial mathematics. Mathematical Association of America.
-
4. Van Voorhis, David C. (1972). Toward a lower bound for sorting networks. Published in R.E. Miller and J.W. Thatcher, eds, The Complexity of Computer Computations, pages 119-129.
-
5. Cerf, V.G., D.D. Cowan, R.C. Mullin & R.G. Stanton. (June 1973) The generalized Petersen graph. 93 pages.
-
6. Cerf, V.G., D.D. Cowan, R.C. Mullin & R.G. Stanton. (August 1973). Construction of the generalized Moore graph on 20 vertices. 12 pages.
-
7. Cerf, V.G., D.D. Cowan, R.C. Mullin & R.G. Stanton. (1975). Topological design considerations in computer communications networks. 18 pages.
-
8. James, L.O. (Undated). A combinatorial proof that the Moore (7, 2) graph is unique. 8 pages.
Cowan, Donald D.