3 articles
Distance-regular graph
A distance-regular graph is a connected graph where, for any two vertices at a given distance, the counts of neighbors at each distance depend only on that distance.
Moore graph
A Moore graph is a regular graph of given degree and diameter containing the maximum possible number of vertices, attaining the Moore bound; examples include the Petersen graph.
Strongly regular graph
A strongly regular graph is a regular graph in which adjacent and non-adjacent vertex pairs have constant numbers of common neighbors, described by parameters (n, k, λ, μ).