Connectivity concerning the last two subconstituents of a \(Q\)-polynomial distance-regular graph (Q2005196)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Connectivity concerning the last two subconstituents of a Q-polynomial distance-regular graph |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0 references
0.90919834
0 references
0.89929944
0 references
0.8947925
0 references
0.89457196
0 references
0.8938885
0 references
0.8931427
0 references
0.8908688
0 references
0.8896259
0 references
