Skip to main content
SpringerLink
Log in

Locally Paley Graphs

  • Published:
Designs, Codes and Cryptography Aims and scope Submit manuscript

Abstract

We conjecturethat all locally Paley graphs are known. For locally Paley(p)with p < 100000 this is true.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. A. E. Brouwer, A. M. Cohen and A. Neumaier, Distance-regular graphs, Springer, Heidelberg (1989).

    Google Scholar 

  2. D. Buset, letter dd 1996–08–11.

  3. W. M. Schmidt, Equations over finite fields, Lecture Notes in Math. 536, Springer, Berlin (1976).

    Google Scholar 

Download references

Authors
  1. A. E. Brouwer
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Brouwer, A.E. Locally Paley Graphs. Designs, Codes and Cryptography 21, 69–76 (2000). https://doi.org/10.1023/A:1008327325509

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1008327325509

Keywords

Search

Navigation