Strongly regular graphs
Last update: 22 Dec 2015 | Contains: 43679 graphs
A k-regular simple graph G on nu nodes is strongly k-regular if there exist positive integers k, lambda, and mu such that every vertex has k neighbors (i.e., the graph is a regular graph), every adjacent pair of vertices has lambda common neighbors, and every nonadjacent pair has mu common neighbors. A strongly regular graph is called primitive if both the graph and its complement are connected.
The census lists primitive strongly regular graphs up to the order 40; however, the complete classification is still open for (37,18,8,9). The census was provided by Brendan McKay (source) and Ted Spence (source).
The census lists primitive strongly regular graphs up to the order 40; however, the complete classification is still open for (37,18,8,9). The census was provided by Brendan McKay (source) and Ted Spence (source).