The classification of \(2\)-extendable edge-regular graphs with diameter \(2\) (Q668067)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7032088
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The classification of \(2\)-extendable edge-regular graphs with diameter \(2\) |
scientific article; zbMATH DE number 7032088 |
Statements
The classification of \(2\)-extendable edge-regular graphs with diameter \(2\) (English)
0 references
5 March 2019
0 references
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\).
0 references
0.8792064785957336
0 references
0.8596664071083069
0 references
0.8588526844978333
0 references
0.8209264874458313
0 references
