Skip to main navigation Skip to search Skip to main content

Every Q-polynomial distance-regular graph is sharp over R

Research output: Contribution to journal › Article › peer-review

Original languageEnglish
Article number106223
JournalJournal of Combinatorial Theory. Series A
Volume224
DOIs
StatePublished - Nov 2026

ASJC Scopus Subject Areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics

Keywords

  • Distance-regular graph
  • Q-polynomial
  • Sharpness
  • Terwilliger algebra
  • Wedderburn decomposition

Fingerprint

Dive into the research topics of 'Every Q-polynomial distance-regular graph is sharp over R'. Together they form a unique fingerprint.

Cite this