Skip to main content
SpringerLink
Log in

The current status of the generalised moore graph problem

  • Invited Addresses
  • Conference paper
  • First Online:
Combinatorial Mathematics VI

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

  • 534 Accesses

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)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 34.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 46.00
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. N.L. Biggs, Algebraic Graph Theory, Cambridge Tracts in Mathematics No. 67 (Cambridge University Press, London, 1974).

    Book  MATH  Google Scholar 

  2. 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.

    Google Scholar 

  3. 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).

    Google Scholar 

  4. 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.

    Google Scholar 

  5. V.G. Cerf, D.D. Cowan, R.C. Mullin, R.G. Stanton, Trivalent Generalised Moore Networks on 16 Nodes, Utilitas Math. 6 (1974).

    Google Scholar 

  6. 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.

    Article  MathSciNet  MATH  Google Scholar 

  7. V.G. Cerf, D.D. Cowan, R.C. Mullin, R.G. Stanton, Some Extremal Graphs, Ars Combinatoria 1 (1976), 119–157.

    MathSciNet  MATH  Google Scholar 

  8. B.D. McKay, Computing Automorphisms and Canonical Labelling of Graphs, to appear, Proc. International Conference on Combinatorics (Canberra, 19777).

    Google Scholar 

Download references

Authors
  1. B. D. McKay
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. R. G. Stanton
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

A. F. Horadam W. D. Wallis

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation