Metraipolis › archive › dc_b32ba96e92eb

Paley graph — Wikipedia (en)

Source
Wikipedia (en)
Original
https://en.wikipedia.org/wiki/Paley_graph
License (as archived)
CC-BY-SA-4.0
Archived
2026-10-07T14:28:35.615Z
SHA-256 of the archived text
1d51cc781221cfb92d03f7a062992727c26d10bb64ddae657ca2041f0767d65f
Stable URL of this page
https://metraipolis.com/documento/dc_b32ba96e92eb

How to cite

Paley graph — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Paley_graph (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_b32ba96e92eb (Metraipolis archive dc_b32ba96e92eb, sha256 1d51cc781221cfb92d03f7a062992727c26d10bb64ddae657ca2041f0767d65f)
BibTeX
@misc{dcb32ba96e92eb,
  title = {Paley graph — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Paley_graph},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_b32ba96e92eb; sha256 1d51cc781221cfb92d03f7a062992727c26d10bb64ddae657ca2041f0767d65f},
  year = {2026}
}

Archived text

Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Paley_graph. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

In mathematics, Paley graphs are undirected graphs constructed from the members of a suitable finite field by connecting pairs of elements that differ by a quadratic residue. The Paley graphs form an infinite family of conference graphs, which yield an infinite family of symmetric conference matrices. Paley graphs allow graph-theoretic tools to be applied to the number theory of quadratic residues, and have interesting properties that make them useful in graph theory more generally. Paley graphs are named after Raymond Paley. They are closely related to the Paley construction for constructing Hadamard matrices from quadratic residues. They were introduced as graphs independently by Sachs (1962) and Erdős & Rényi (1963). Sachs was interested in them for their self-complementarity properties, while Erdős and Rényi studied their symmetries. Paley digraphs are directed analogs of Paley graphs that yield antisymmetric conference matrices. They were introduced by Graham & Spencer (1971) (independently of Sachs, Erdős, and Rényi) as a way of constructing tournaments with a property previously known to be held only by random tournaments: in a Paley digraph, every small subset of vertices is dominated by some other vertex.

Tema degli esploratori: matematica e informatica teorica (deposito sistematico; ricerca «graph theory»).
Fonte: Wikipedia in inglese, voce «Paley graph» — https://en.wikipedia.org/wiki/Paley_graph
Wikidata Q3026495 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q3026495
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Paley_graph?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1337487988, consultata il 2026-10-07T14:08:00.555Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: feebe20ea6884588cdf7afc3c26eb958788426647ad612fe98dfe928ea822a11