Skip to main content

New inequalities for the parameters of an association scheme

  • Contributed Papers
  • Conference paper
  • First Online:
Book cover Combinatorics and Graph Theory

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

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

Access this chapter

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

References

  1. P.J. Cameron, J.M. Goethals, and J.J. Seidel, The Krein condition, spherical designs, Norton algebras and permutation groups, Proc. Kon. Ned. Acad. Wet. A81 (1978), 196–206.

    MathSciNet  MATH  Google Scholar 

  2. J.J. Seidel, Strongly regular graphs, an introduction, Proc. 7th Brit. Comb. Conf., Cambridge (LMS Lecture Notes Series 38) 1979, 157–180.

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Siddani Bhaskara Rao

Rights and permissions

Reprints and permissions

Copyright information

© 1981 Springer-Verlag

About this paper

Cite this paper

Neumaier, A. (1981). New inequalities for the parameters of an association scheme. In: Rao, S.B. (eds) Combinatorics and Graph Theory. Lecture Notes in Mathematics, vol 885. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0092282

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-11151-1

  • Online ISBN: 978-3-540-47037-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics