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

Producción científica: Article › revisión exhaustiva

Idioma original	English
Número de artículo	106223
Publicación	Journal of Combinatorial Theory. Series A
Volumen	224
DOI	https://doi.org/10.1016/j.jcta.2026.106223
Estado	Published - nov 2026

ASJC Scopus Subject Areas

@article{249eeff8360745fc8fabd653178dc16e,

title = "Every Q-polynomial distance-regular graph is sharp over R",

keywords = "Distance-regular graph, Q-polynomial, Sharpness, Terwilliger algebra, Wedderburn decomposition",

author = "Blas Fern{\'a}ndez and Lee, \{Jae Ho\} and Jongyook Park",

note = "Publisher Copyright: {\textcopyright} 2026 Elsevier Inc.",

year = "2026",

month = nov,

doi = "10.1016/j.jcta.2026.106223",

language = "English",

volume = "224",

}

TY - JOUR

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

AU - Fernández, Blas

AU - Lee, Jae Ho

AU - Park, Jongyook

PY - 2026/11

Y1 - 2026/11

KW - Distance-regular graph

KW - Q-polynomial

KW - Sharpness

KW - Terwilliger algebra

KW - Wedderburn decomposition

UR - https://www.scopus.com/pages/publications/105040074468

UR - https://www.scopus.com/pages/publications/105040074468#tab=citedBy

U2 - 10.1016/j.jcta.2026.106223

DO - 10.1016/j.jcta.2026.106223

M3 - Article

AN - SCOPUS:105040074468

SN - 0097-3165

VL - 224

JO - Journal of Combinatorial Theory. Series A

JF - Journal of Combinatorial Theory. Series A

M1 - 106223

ER -