A spectral equivalent condition of the \(P\)-polynomial property for association schemes (Q405275)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6340225
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A spectral equivalent condition of the \(P\)-polynomial property for association schemes |
scientific article; zbMATH DE number 6340225 |
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
0.8110832571983337
0 references
0.8093553781509399
0 references
0.7844669818878174
0 references
0.7814456224441528
0 references
0.7805835604667664
0 references
