Paley graph
node-link graph of elements of a finite field, adjacent when their difference is a quadratic residue
Facts
4 properties- Instance of
- mathematical concept
- Subclass of
- undirected graph, dense graph, strongly regular graph, self-complementary graph, conference graph, Hamiltonian graph[3][4][5][6][7][8]
- Named after
- Raymond Paley[2]
- Studied by
- graph theory[9]
🏷️ Also known as
en Paley graph
el Γράφημα Πέιλι
fr graphe de Paley
hu Paley-gráf
ja パリーグラフ
ja ペーリーグラフ
ja ペイリーグラフ
ko 페일리 그래프
pt grafo de Paley
ru граф Пейли
ru графы Пейли
uk граф Пейлі
uk граф Пелі
zh Paley图
zh 佩利图
🔖 Identifiers · 4
- Freebase ID
- /m/0f0_r1
- MathWorld ID
- PaleyGraph
- Microsoft Academic ID (discontinued)
- 17827800
- Wolfram Language entity code
- Entity["GraphClass", "Paley"]
🔗 Connections
Subclass of 6
Created notable works 1
Maintained by WikiProject 1
Named after 1
Studied by 1
Press Enter · cited answer in seconds
0 sources
Summary
Paley graph is a mathematical concept[1].