Distance-regular graphs with intersection array \(\{69,56,10;1,14,60\}\), \(\{74,54,15;1,9,60\}\) and \(\{119,100,15;1,20,105\}\) do not exist (Q2331137): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q3992965 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Sylvester graph and Moore graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On distance-regular graph \(\Gamma\) with strongly regular graphs \(\Gamma_2\) and \(\Gamma_3\) / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On automorphisms of a distance-regular graph with intersection array $\{69, 56, 10; 1, 14, 60\}$ / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On automorphisms of a distance-regular graph with intersection array \(\{119,100,15;1,20,105\}\) / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Using equality in the Krein conditions to prove nonexistence of certain distance-regular graphs / rank | |||
Normal rank | |||
Latest revision as of 19:35, 20 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Distance-regular graphs with intersection array \(\{69,56,10;1,14,60\}\), \(\{74,54,15;1,9,60\}\) and \(\{119,100,15;1,20,105\}\) do not exist |
scientific article |
Statements
Distance-regular graphs with intersection array \(\{69,56,10;1,14,60\}\), \(\{74,54,15;1,9,60\}\) and \(\{119,100,15;1,20,105\}\) do not exist (English)
0 references
25 October 2019
0 references
distance-regular graph
0 references
triple intersection numbers
0 references
0 references
0 references
0 references
