Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
N.L. Biggs, Algebraic Graph Theory, Cambridge Tracts in Mathematics No. 67 (Cambridge University Press, London, 1974).
V.G. Cerf, D.D. Cowan, R.C. Mullin, R.G. Stanton, Computer Networks and Generalised Moore Graphs, Proceedings Third Manitoba Conference on Numerical Mathematics, Congressus Numerantium IX (Winnipeg, 1973), 379–398.
V.G. Cerf, D.D. Cowan, R.C. Mullin, R.G. Stanton, Topological Design Considerations in Computer Communications Networks, Computer Communication Networks (ed. R.L. Grimsdale and F.F. Kuo), Nato Advanced Study Institute Noordhoff, Leyden (1975).
V.G. Cerf, D.D. Cowan, R.C. Mullin, R.G. Stanton, A Partial Census of Trivalent Generalised Moore Graphs, Invited Address, Proc. 3rd Australian Combinatorial Conference (Brisbane, 1974), (Springer-Verlag), 1–27.
V.G. Cerf, D.D. Cowan, R.C. Mullin, R.G. Stanton, Trivalent Generalised Moore Networks on 16 Nodes, Utilitas Math. 6 (1974).
V.G. Cerf, D.D. Cowan, R.C. Mullin, R.G. Stanton, A Lower Bound on the Average Shortest Path Length in Regular Graphs, Networks, Vol. 4, No. 4 (1974), John Wiley & Sons, 335–342.
V.G. Cerf, D.D. Cowan, R.C. Mullin, R.G. Stanton, Some Extremal Graphs, Ars Combinatoria 1 (1976), 119–157.
B.D. McKay, Computing Automorphisms and Canonical Labelling of Graphs, to appear, Proc. International Conference on Combinatorics (Canberra, 19777).
Editor information
Rights and permissions
Copyright information
© 1979 Springer-Verlag
About this paper
Cite this paper
McKay, B.D., Stanton, R.G. (1979). The current status of the generalised moore graph problem. In: Horadam, A.F., Wallis, W.D. (eds) Combinatorial Mathematics VI. Lecture Notes in Mathematics, vol 748. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0102681
Download citation
DOI: https://doi.org/10.1007/BFb0102681
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-09555-2
Online ISBN: 978-3-540-34857-3
eBook Packages: Springer Book Archive