Interview with Don Cowan.
Interview with Don Cowan.
Computerized weaving of Ralph Stanton.
Computerized weaving of Ralph Stanton.
Convocation, Saturday P.M.
Convocation, Saturday P.M.
Distinguished Lecturer Series, Math and Computers, Ralph Stanton.
Distinguished Lecturer Series, Math and Computers, Ralph Stanton.
Professor Ralph Stanton.
Professor Ralph Stanton.
Convocation.
Convocation.
Waterloo College, Industrial Conference
Waterloo College, Industrial Conference
Stanton, Ralph : photograph.
Stanton, Ralph : photograph.
Graduation and Diploma Ceremony : University of Natal.
Graduation and Diploma Ceremony : University of Natal.
Correspondence.
Correspondence.
Some unique extremal graphs / V.G. Cerf, D.D. Cowan, R.C. Mullin, and R.G. Stanton.
Some unique extremal graphs / V.G. Cerf, D.D. Cowan, R.C. Mullin, and R.G. Stanton.
Some results on tree numbers / L.O. James, R.G. Stanton, and D.D. Cowan.
Some results on tree numbers / L.O. James, R.G. Stanton, and D.D. Cowan.
Some results on path numbers / R.G. Stanton, D.D. Cowan and L.O. James.
Some results on path numbers / R.G. Stanton, D.D. Cowan and L.O. James.
A problem in coding theory / L.O. James, R.G. Stanton, and D.D. Cowan.
A problem in coding theory / L.O. James, R.G. Stanton, and D.D. Cowan.
Note on a "square" functional equation / R.G. Stanton and D.D. Cowan.
Note on a "square" functional equation / R.G. Stanton and D.D. Cowan.
Minimal sequences with permutation subsequences / R.G. Stanton, J.A. Bate, and D.D. Cowan.
Minimal sequences with permutation subsequences / R.G. Stanton, J.A. Bate, and D.D. Cowan.
Graph decomposition for undirected graphs / L.O. James, R.G. Stanton, and D.D. Cowan.
Graph decomposition for undirected graphs / L.O. James, R.G. Stanton, and D.D. Cowan.
Computer networks and generalized Moore graphs / V.G. Cerf, D.D. Cowan, R.C. Mullin, and R.G. Stanton.
Computer networks and generalized Moore graphs / V.G. Cerf, D.D. Cowan, R.C. Mullin, and R.G. Stanton.
The growth of network cost as a function of network size / V.G. Cerf, D.D. Cowan, R.C. Mullin, and R.G. Stanton.
The growth of network cost as a function of network size / V.G. Cerf, D.D. Cowan, R.C. Mullin, and R.G. Stanton.
The generalized Petersen graph / V.G. Cerf, D.D. Cowan, R.C. Mullin, and R.G. Stanton.
The generalized Petersen graph / V.G. Cerf, D.D. Cowan, R.C. Mullin, and R.G. Stanton.
Counting algorithms for connected labelled graphs / D.D. Cowan, R.C. Mullin, and R.G. Stanton.
Counting algorithms for connected labelled graphs / D.D. Cowan, R.C. Mullin, and R.G. Stanton.
Construction of the generalized Moore graphs / V.G. Cerf, D.D. Cowan, R.C. Mullin, and R.G. Stanton.
Construction of the generalized Moore graphs / V.G. Cerf, D.D. Cowan, R.C. Mullin, and R.G. Stanton.
A partial census of trivalent generalized Moore graphs / V.G. Cerf, D.D. Cowan, R.C. Mullin, and R.G. Stanton.
A partial census of trivalent generalized Moore graphs / V.G. Cerf, D.D. Cowan, R.C. Mullin, and R.G. Stanton.
Automorphisms.
Automorphisms.
Anne Innis Dagg : PhD file, 1967.
Anne Innis Dagg : PhD file, 1967.
