Twice Q-polynomial distance-regular graphs are thin (Q1902962): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0195-6698(95)90037-3 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2026970773 / rank | |||
Normal rank | |||
Revision as of 20:04, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Twice Q-polynomial distance-regular graphs are thin |
scientific article |
Statements
Twice Q-polynomial distance-regular graphs are thin (English)
0 references
25 November 1996
0 references
The author shows that if a distance-regular graph \(\Gamma\) of diameter \(d\geq 3\) is \(Q\)-polynomial with respect to distinct eigenvalues, then \(\Gamma\) is thin in the sense of Terwilliger.
0 references
\(Q\)-polynomial graph
0 references
thin graph
0 references
distance-regular graph
0 references
