(25, 12, 5, 6)-strongly Regular Graph 15
vertex count | 25 edge count | 150 connected component count | 1
arc-transitive | biconnected | bridgeless | Cayley graphs | class 2 | conference | conformally rigid | connected | cyclic | distance-regular | distance-transitive | edge-transitive | Eulerian | fully reconstructible in C^1 | geometric | Hamilton-connected | Hamilton-decomposable | Hamiltonian | H-star connected | imperfect | integral | intrinsically linked | LCF | local | multigraphic | nonempty | nonplanar | no perfect matching | not determined by spectrum | not uniquely embeddable | Paley | pancyclic | Paulus | regular | rigid | self-complementary | simple | strongly regular | switchable | symmetric | traceable | ungraceful | vertex-transitive | weakly perfect
25-Paley graph
(not a named graph)
vertex degrees | 12 (25 vertices)
radius | 2 diameter | 2 girth | 3 vertex connectivity | 12 edge connectivity | 12
(x - 12) (x - 2)^12 (x + 3)^12