Every Q-polynomial distance-regular graph is sharp over \mathbb{R}

MaRDI QIDQ7204881arXivFDO

Authors Blas Fernández, Jae-Ho Lee, Jongyook Park

Publication date 2025

Published in arXiv

Mathematics Subject Classification ID

Combinatorial aspects of representation theory (05E10) Association schemes, strongly regular graphs (05E30)

arXiv classification

math.CO

This page was built for publication: Every $Q$-polynomial distance-regular graph is sharp over $\mathbb{R}$

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7204881)