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.
Keywords
- Root Node
- Regular Graph
- Hamiltonian Form
- Average Path Length
- Topological Design
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, access via your institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
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).
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.
F. Harary, Graph Theory (Addison-Wesley, Reading, Mass., 1969)
A. J. Hoffman and R. R. Singleton, On Moore Graphs with Diameters Two and Three, IBM Journal of Research and Development (1960), 497–504.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1975 Springer-Verlag
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:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-07154-9
Online ISBN: 978-3-540-37482-4
eBook Packages: Springer Book Archive
