Showing 18 results

Archival description
Mullin, Ronald Cleveland
Print preview View:
Ascending

A partial census of trivalent generalized Moore graphs / V.G. Cerf, D.D. Cowan, R.C. Mullin, and R.G. Stanton.

A typed manuscript titled, "A partial census of trivalent generalized Moore graphs" by V.G. Cerf, Donald Cowan, R.C. Mullin, and R.G. Stanton. The manuscript is one hundred and four pages. Also includes a photocopy of the same article, possibly from the source of publication. This photocopy is twenty-seven pages.

Cowan, Donald D.

Computer networks and generalized Moore graphs / V.G. Cerf, D.D. Cowan, R.C. Mullin, and R.G. Stanton.

A report titled, "Computer networks and generalized Moore graphs," by Donald Cowan, V.G. Cerf, R.C. Mullin, R.G. Stanton. This report was published as External Report 15 by the Computer Communications Network Group (CCNG) at the University of Waterloo. The report was also published in an an offprint from Proceedings of the Third Manitoba Conference on Numerical Mathematics, October 3-6, 1973, pages 379-398.

Cowan, Donald D.

Construction of the generalized Moore graphs / V.G. Cerf, D.D. Cowan, R.C. Mullin, and R.G. Stanton.

Six typed manuscripts of unpublished papers regarding the construction of generalized Moore graphs by Donald Cowan, V.G. Cerf, R.C. Mullin, and Ralph G. Stanton including:

  • 1. Cerf, V.G., D.D. Cowan, R.C. Mullin and R.G. Stanton. Construction of the Generalized Moore Graph on 14 vertices. 16 pages.

  • 2. Cerf, V.G., D.D. Cowan, R.C. Mullin and R.G. Stanton. Construction of the Generalized Moore Graph on 16 vertices. 21 pages.

  • 3. Cerf, V.G., D.D. Cowan, R.C. Mullin and R.G. Stanton. Construction of the Generalized Moore Graph on 18 vertices. 28 pages.

  • 4. Cerf, V.G., D.D. Cowan, R.C. Mullin and R.G. Stanton. Construction of the Generalized Moore Graph on 20 vertices. 13 pages.

  • 5. Cerf, V.G., D.D. Cowan, R.C. Mullin and R.G. Stanton. Construction of the Generalized Moore Graph on 24 vertices. 12 pages.

  • 6. Cerf, V.G., D.D. Cowan, R.C. Mullin and R.G. Stanton. Construction of the Generalized Moore Graph on 26 vertices. 51 pages.

Cowan, Donald D.

Counting algorithms for connected labelled graphs / D.D. Cowan, R.C. Mullin, and R.G. Stanton.

Two copies of a typed manuscript titled, "Counting algorithms for connected labelled graphs" by Donald Cowan, R.C. Mullin, and Ralph G. Stanton. The manuscript is twelve pages. This paper was presented at the sixth Southeastern Conference on Combinatorics, Graph Theory, and Computing held at Florida Atlantic University in Boca Raton, Florida between February 17-20, 1975. This paper was subsequently published in the Proceedings of the sixth Southeastern Conference on Combinatorics, Graph Theory, and Computing, pages 219-231. Also includes correspondence related to the submission of the paper to the conference.

Cowan, Donald D.