A spectral equivalent condition of the \(P\)-polynomial property for association schemes

zbMath1300.05331arXiv1110.4975MaRDI QIDQ405275

Hiroshi Nozaki, Hirotake Kurihara

Publication date: 4 September 2014

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1110.4975

zbMATH Keywords

distance-regular graph; graph spectrum; spectral excess theorem; \(P\)-polynomial association scheme; predistance polynomial

Mathematics Subject Classification ID

05E30: Association schemes, strongly regular graphs

05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)

Related Items

Equivalent characterizations of the spectra of graphs and applications to measures of distance-regularity, Polynomial properties on large symmetric association schemes, A characterization of \(Q\)-polynomial association schemes, Tridiagonal matrices with nonnegative entries

Cites Work

• Dual concepts of almost distance-regularity and the spectral excess theorem
• A short proof of the odd-girth theorem
• Characterizing \((\ell ,m)\)-walk-regular graphs
• A characterization of \(Q\)-polynomial association schemes
• A simple proof of the spectral excess theorem for distance-regular graphs
• The spectral excess theorem for distance-regular graphs: a global (over)view
• From local adjacency polynomials to locally pseudo-distance-regular graphs
• Tridiagonal matrices with nonnegative entries
• On almost distance-regular graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item