A spectral equivalent condition of the \(P\)-polynomial property for association schemes (Q405275): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / review text
 
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.
Property / review text: 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. / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05E30 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C50 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6340225 / rank
 
Normal rank
Property / zbMATH Keywords
 
\(P\)-polynomial association scheme
Property / zbMATH Keywords: \(P\)-polynomial association scheme / rank
 
Normal rank
Property / zbMATH Keywords
 
distance-regular graph
Property / zbMATH Keywords: distance-regular graph / rank
 
Normal rank
Property / zbMATH Keywords
 
graph spectrum
Property / zbMATH Keywords: graph spectrum / rank
 
Normal rank
Property / zbMATH Keywords
 
spectral excess theorem
Property / zbMATH Keywords: spectral excess theorem / rank
 
Normal rank
Property / zbMATH Keywords
 
predistance polynomial
Property / zbMATH Keywords: predistance polynomial / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1110.4975 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3218140 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2785496 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dual concepts of almost distance-regularity and the spectral excess theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On almost distance-regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizing \((\ell ,m)\)-walk-regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The spectral excess theorem for distance-regular graphs: a global (over)view / rank
 
Normal rank
Property / cites work
 
Property / cites work: A short proof of the odd-girth theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5707657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: From local adjacency polynomials to locally pseudo-distance-regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple proof of the spectral excess theorem for distance-regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of \(Q\)-polynomial association schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2885887 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tridiagonal matrices with nonnegative entries / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 23:50, 8 July 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
    0 references
    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

    Identifiers