Display title | Paley graph |
Default sort key | Paley graph |
Page length (in bytes) | 12,396 |
Namespace ID | 0 |
Page ID | 211800 |
Page content language | en - English |
Page content model | wikitext |
Indexing by robots | Allowed |
Number of redirects to this page | 0 |
Counted as a content page | Yes |
Page image |  |
HandWiki item ID | None |
Edit | Allow all users (infinite) |
Move | Allow all users (infinite) |
Page creator | imported>Wikisleeper |
Date of page creation | 16:45, 6 February 2024 |
Latest editor | imported>Wikisleeper |
Date of latest edit | 16:45, 6 February 2024 |
Total number of edits | 1 |
Recent number of edits (within past 90 days) | 0 |
Recent number of distinct authors | 0 |
Description | Content |
Article description: (description ) This attribute controls the content of the description and og:description elements. | 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... |