Skip to main content
SpringerLink
Log in

Graphs and two-distance sets

  • Invited Papers
  • Conference paper
  • First Online:
Combinatorial Mathematics VIII

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

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. E. and E. Bannai, An upper bound for the cardinality of an s-distance subset in real Euclidean space, manuscript.

    Google Scholar 

  2. P.J. Cameron, J.M. Geethals, J.J. Seidel, E.E. Shult, Line graphs, root systems, and elliptic geometry, J. Algebra 43 (1976), 305–327.

    Article  MathSciNet  MATH  Google Scholar 

  3. Ph. Delsarte, J.M. Geothals, J.J. Seidel, Spherical codes and designs, Geom. Dedic. 6 (1977), 363–388.

    Article  MathSciNet  MATH  Google Scholar 

  4. S.J. Einhorn, I.J. Schoenberg, On euclidean sets having only two distances between points, Indag. Math. 28 (1966), 479–504.

    Article  MathSciNet  MATH  Google Scholar 

  5. X.L. Hubaut, Strongly regular graphs, Discrete Math. 13 (1975), 357–381.

    Article  MathSciNet  MATH  Google Scholar 

  6. O. Kristensen, private communication via H. Tverberg.

    Google Scholar 

  7. D.G. Larman, C.A. Rogers, J.J. Seidel, On two-distance sets in Euclidean space, Bull. London Math. Soc. 9 (1977), 261–267.

    Article  MathSciNet  MATH  Google Scholar 

  8. P.W.H. Lemmens, J.J. Seidel, Equiangular lines, J. Algebra 24 (1973), 494–512.

    Article  MathSciNet  MATH  Google Scholar 

  9. A. Neumaier, Distance matrices, dimension, and conference graphs, Indag. Math., to be published.

    Google Scholar 

  10. J.J. Seidel, Eutactic stars, Coll. Math. Soc. Bolyai 18, Combinatorics, Keszthely (1976), 983–999.

    MathSciNet  MATH  Google Scholar 

  11. J.J. Seidel, Strongly regular graphs, Surveys in Combinatorics (ed. B. Bollobás), London Math. soc. Lecture Note Series 38 (1979), 157–180.

    Google Scholar 

  12. E. Shult, A. Yanushka, Near n-gons and line systems, Geom. Dedic. 9 (1980), 1–72.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Eindhoven University of Technology, P.O. Box 513, 5600 MB, Eindhoven, The Netherlands

    J. J. Seidel

Authors
  1. J. J. Seidel
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Kevin L. McAvaney

Rights and permissions

Reprints and permissions

Copyright information

© 1981 Springer-Verlag

About this paper

Cite this paper

Seidel, J.J. (1981). Graphs and two-distance sets. In: McAvaney, K.L. (eds) Combinatorial Mathematics VIII. Lecture Notes in Mathematics, vol 884. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0091810

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-10883-2

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation