Strongly regular graphs

cubic graph with 10 vertices and 15 edges

graph in which the number of shared neighbors of two vertices depends only on whether they are adjacent

node-link graph with 50 vertices and 175 edges, the smallest possible 7-regular graph of girth 5

node-link graph of elements of a finite field, adjacent when their difference is a quadratic residue

one of two different regular graphs with 16 vertices

special case of a strongly regular graph

one of three 12-regular graphs with 28 vertices and 168 edges

highly-symmetric node-link graph with 100 vertices and 22 edges per vertex

strongly regular graph with 16 vertices and 48 edges

20-regular undirected graph with 81 vertices and 810 edges

graph that represents all legal moves of the rook chess piece on a chessboard

strongly regular graph with 56 vertices and valency 10

strongly regular Cayley graph with 77 vertices and 616 edges

16-regular graph with 27 vertices and 216 edges