The classification of \(2\)-extendable edge-regular graphs with diameter \(2\) (Q668067): Difference between revisions

Summary: Let \(\ell\) denote a non-negative integer. A connected graph \(\Gamma\) of even order at least \(2\ell+2\) is \(\ell\)-\textit{extendable} if it contains a matching of size \(\ell\) and if every such matching is contained in a perfect matching of \(\Gamma\). A connected regular graph \(\Gamma\) is \textit{edge-regular}, if there exists an integer \(\lambda\) such that every pair of adjacent vertices of \(\Gamma\) have exactly \(\lambda\) common neighbours. In this paper we classify \(2\)-extendable edge-regular graphs of even order and diameter \(2\).