Connectivity concerning the last two subconstituents of a \(Q\)-polynomial distance-regular graph (Q2005196): Difference between revisions
From MaRDI portal
Latest revision as of 18:04, 23 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Connectivity concerning the last two subconstituents of a \(Q\)-polynomial distance-regular graph |
scientific article |
Statements
Connectivity concerning the last two subconstituents of a \(Q\)-polynomial distance-regular graph (English)
0 references
7 October 2020
0 references
distance-regular graph
0 references
connectivity
0 references
subconstituent
0 references
\(Q\)-polynomial
0 references
primitive idempotent
0 references
balanced set condition
0 references
eigenvalue
0 references
strongly regular graph
0 references
association scheme
0 references
diameter
0 references