Extremal 1-codes in distance-regular graphs of diameter 3 (Q438900): 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: Using equality in the Krein conditions to prove nonexistence of certain distance-regular graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Shilla distance-regular graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A characterization of \(P\)- and \(Q\)-polynomial association schemes / rank | |||
Normal rank | |||
Latest revision as of 11:56, 5 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Extremal 1-codes in distance-regular graphs of diameter 3 |
scientific article |
Statements
Extremal 1-codes in distance-regular graphs of diameter 3 (English)
0 references
31 July 2012
0 references
distance-regular graphs
0 references
1-codes
0 references
Krein condition
0 references
triple intersection numbers
0 references
nonexistence
0 references
algebraic combinatorics
0 references
0 references
