Strongly regular graph: Difference between revisions

Revision as of 18:47, 20 May 2024

Revision as of 16:56, 17 June 2024

Line 39:

* The [[McLaughlin graph]] is an srg(275, 112, 30, 56).

* The [[Paley graph]] of order ''q'' is an srg(''q'', (''q'' − 1)/2, (''q'' − 5)/4, (''q'' − 1)/4). The smallest Paley graph, with {{nowrap|''q'' {{=}} 5}}, is the 5-cycle (above).

* [[Self-complementary graph|selfSelf-complementary]] [[symmetric graph|arc-transitive]] graphs are strongly regular.

A strongly regular graph is called '''primitive''' if both the graph and its complement are connected. All the above graphs are primitive, as otherwise {{nowrap|μ {{=}} 0}} or {{nowrap|λ {{=}} ''k''}}.