A partial census of trivalent generalized Moore networks

Cerf, V. G.; Cowan, D. D.; Mullin, R. C.; Stanton, R. G.

doi:10.1007/BFb0069540

V. G. Cerf^1,2,3,4,5,
D. D. Cowan^1,2,3,4,5,
R. C. Mullin^1,2,3,4,5 &
…
R. G. Stanton^1,2,3,4,5

Part of the book series: Lecture Notes in Mathematics ((LNM,volume 452))

311 Accesses
5 Citations

Abstract

The authors have previously introduced a family of graphs possessing "average minimum path length" as a useful model for an idealized computer network. The present paper gives a detailed determination of all non-isomorphic members of the family up to 14 nodes. Results, to appear in a later paper, are announced for graphs up to 34 nodes.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Chapter: USD 29.95; Price excludes VAT (USA)

eBook: USD 34.99; Price excludes VAT (USA)

Softcover Book: USD 46.00; Price excludes VAT (USA)

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

References

V. G. Cerf, D. D. Cowan, R. C. Mullin, R. G. Stanton, Topological Design Considerations in Computer Communications Networks in Computer Communication Networks, ed. R. L. Grimsdale and F. F. Kuv, Nato Advanced Study Institute Series (April, 1974).
Google Scholar
V. G. Cerf, D. D. Cowan, R. C. Mullin, R. G. Stanton, Computer Networks and Generalized Moore Graphs, Congressus Numerantium 9, Proc. Third Manitoba Conference on Numerical Mathematics (1973), 379–398.
Google Scholar
F. Harary, Graph Theory (Addison-Wesley, Reading, Mass., 1969)
MATH Google Scholar
A. J. Hoffman and R. R. Singleton, On Moore Graphs with Diameters Two and Three, IBM Journal of Research and Development (1960), 497–504.
Google Scholar

Download references

Author information

Authors and Affiliations

Digital Systems Laboratory, Stanford University, California, USA
V. G. Cerf, D. D. Cowan, R. C. Mullin & R. G. Stanton
Department of Computer Science, University of Waterloo, Ontario, Canada
V. G. Cerf, D. D. Cowan, R. C. Mullin & R. G. Stanton
Department of Combinatorics and Optimization, University of Waterloo, Ontario, Canada
V. G. Cerf, D. D. Cowan, R. C. Mullin & R. G. Stanton
Department of Computer Science, University of Manitoba, Winnipeg, Canada
V. G. Cerf, D. D. Cowan, R. C. Mullin & R. G. Stanton
Faculty of Mathematics, University of Newcastle, New South Wales, Australia
V. G. Cerf, D. D. Cowan, R. C. Mullin & R. G. Stanton

Authors

V. G. Cerf
View author publications
You can also search for this author in PubMed Google Scholar
D. D. Cowan
View author publications
You can also search for this author in PubMed Google Scholar
R. C. Mullin
View author publications
You can also search for this author in PubMed Google Scholar
R. G. Stanton
View author publications
You can also search for this author in PubMed Google Scholar

Editor information

Anne Penfold Street Walter Denis Wallis

Rights and permissions

Reprints and permissions

Copyright information

About this paper

Cite this paper

Cerf, V.G., Cowan, D.D., Mullin, R.C., Stanton, R.G. (1975). A partial census of trivalent generalized Moore networks. In: Street, A.P., Wallis, W.D. (eds) Combinatorial Mathematics III. Lecture Notes in Mathematics, vol 452. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0069540

Download citation

DOI: https://doi.org/10.1007/BFb0069540
Published: 28 August 2006
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-07154-9
Online ISBN: 978-3-540-37482-4
eBook Packages: Springer Book Archive

Publish with us

Policies and ethics