Fernández, B., Lee, J., & Park, J. (2025). Every $Q$-polynomial distance-regular graph is sharp over $\mathbb{R}$.
Cita Chicago Style (17a ed.)Fernández, Blas, Jae-Ho Lee, y Jongyook Park. Every $Q$-polynomial Distance-regular Graph Is Sharp over $\mathbb{R}$. 2025.
Cita MLA (9a ed.)Fernández, Blas, et al. Every $Q$-polynomial Distance-regular Graph Is Sharp over $\mathbb{R}$. 2025.
Precaución: Estas citas no son 100% exactas.