A spectral equivalent condition of the \(P\)-polynomial property for association schemes (Q405275): Difference between revisions
From MaRDI portal
Set profile property. |
Changed an Item |
||
Property / arXiv ID | |||
Property / arXiv ID: 1110.4975 / rank | |||
Normal rank |
Revision as of 13:21, 18 April 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A spectral equivalent condition of the \(P\)-polynomial property for association schemes |
scientific article |
Statements
A spectral equivalent condition of the \(P\)-polynomial property for association schemes (English)
0 references
4 September 2014
0 references
Summary: We give two equivalent conditions of the \(P\)-polynomial property of a symmetric association scheme. The first equivalent condition shows that the \(P\)-polynomial property is determined only by the first and second eigenmatrices of the symmetric association scheme. The second equivalent condition is another expression of the first using predistance polynomials.
0 references
\(P\)-polynomial association scheme
0 references
distance-regular graph
0 references
graph spectrum
0 references
spectral excess theorem
0 references
predistance polynomial
0 references