Source: wikibot/strongly-regular-graph
= Strongly regular graph
{wiki=Strongly_regular_graph}
A strongly regular graph is a specific type of graph characterized by a regular structure that satisfies certain conditions regarding its vertices and edges. Formally, a strongly regular graph \\( G \\) is defined by three parameters \\( (n, k, \\lambda, \\mu) \\) where: - \\( n \\) is the total number of vertices in the graph.