Skip to main content

Rank 3 graphs

  • 648 Accesses

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

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   34.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   46.00
Price excludes VAT (Canada)
  • 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

Learn about institutional subscriptions

References

  1. D.G. Higman, Finite permutation groups of rank 3, Math. Z., 86 (1964), 145–156.

    CrossRef  MathSciNet  MATH  Google Scholar 

  2. D.G. Higman and C.C. Sims, A simple group of order 44,352,000, Math. Z., 105 (1968), 110–113.

    CrossRef  MathSciNet  MATH  Google Scholar 

  3. A.J. Hoffman, On the uniqueness of the triangular association scheme, Ann. Math. Stat., 31 (1960), 492–497.

    CrossRef  MathSciNet  MATH  Google Scholar 

  4. J.E. McLaughlin, A simple group of order 275|U4(3)|, to appear.

    Google Scholar 

  5. M. Suzuki, A simple group of order 448,345,497,600, to appear.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 1969 Springer-Verlag

About this paper

Cite this paper

Hestenes, M.D. (1969). Rank 3 graphs. In: Chartrand, G., Kapoor, S.F. (eds) The Many Facets of Graph Theory. Lecture Notes in Mathematics, vol 110. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0060116

Download citation

  • DOI: https://doi.org/10.1007/BFb0060116

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-04629-5

  • Online ISBN: 978-3-540-36161-9

  • eBook Packages: Springer Book Archive