A spectral equivalent condition of the $P$-polynomial property for association schemes

Built on

An algebraic approach to the association schemes of coding theory
P. Delsarte · 1973
Earlier work this paper cites.
Algebraic combinatorics. I
E. Bannai and T. Ito · 1984
Earlier work this paper cites.
Eigenspaces of graphs
D. Cvetković, P. Rowlinson and S. Simić · 1997
Earlier work this paper cites.
From local adjacency polynomials to locally pseudo-distance-regular graphs
M.A. Fiol and E. Garriga · 1997
Earlier work this paper cites.
The spectral excess theorem for distance-regular graphs: a global (over)view
E.R. van Dam · 2008
Earlier work this paper cites.

Characterizing ( ℓ , m ) (\ell,m) -walk-regular graphs
C. Dalfó, M.A. Fiol and E. Garriga · 2010
Cited alongside, same era.
A simple proof of the spectral excess theorem for distance-regular graphs
M.A. Fiol, S. Gago and E. Garriga · 2010
Cited alongside, same era.
On almost distance-regular graphs
C. Dalfó, E.R. van Dam, M.A. Fiol, E. Garriga and B.L. Gorissen · 2011
Cited alongside, same era.
k k -walk-regular digraphs
W. Liu and J. Lin · 2011
Cited alongside, same era.

Tridiagonal matrices with nonnegative entries
K. Nomura and P. Terwilliger · 2011
Closest in time.
Dual concepts of almost distance-regularity and the spectral excess theorem
C. Dalfó, E.R. van Dam, M.A. Fiol and E. Garriga · 2012
Closest in time.
A short proof of the odd-girth theorem
E.R. van Dam and M.A. Fiol · 2012
Closest in time.
A characterization of Q Q -polynomial association schemes
H. Kurihara and H. Nozaki · 2012
Closest in time.