Paley graph:P17
This article defines a particular undirected graph, i.e., the definition here determines the graph uniquely up to graph isomorphism.
View a complete list of particular undirected graphs
Definition
This graph is defined as the Paley graph corresponding to the field of 17 elements.
Graph properties
| Property | Satisfied? | Explanation |
|---|---|---|
| self-complementary graph | Yes | Paley graphs are self-complementary |
| strongly regular graph | Yes | Paley graphs are strongly regular |
| regular graph | Yes | Follows from being strongly regular. The degree of each vertex is . |
| conference graph | Yes | Paley graphs are conference graphs |
| symmetric graph | Yes | |
| edge-transitive graph | Yes | Follows on account of being Paley |
| vertex-transitive graph | Yes |
