Tools
Tools
Bang, Sejeong, Dubickas, Arturas, Koolen, Jack and Moulton, Vincent 
ORCID: https://orcid.org/0000-0001-9371-6435
(2015)
There are only finitely many distance-regular graphs of fixed valency greater than two.
Advances in Mathematics, 269.
pp. 1-55.
ISSN 0001-8708
Preview |
PDF (submitted-sept2014)
- Accepted Version
Available under License Creative Commons Attribution Non-commercial No Derivatives. Download (421kB) | Preview |
Abstract
In this paper we prove the Bannai–Ito conjecture, namely that there are only finitely many distance-regular graphs of fixed valency greater than two.
| Item Type: | Article |
|---|---|
| Uncontrolled Keywords: | distance-regular graphs,bannai–ito conjecture,sims conjecture,othogonal polynomials,christoffel numbers |
| Faculty \ School: | Faculty of Science > School of Computing Sciences |
| UEA Research Groups: | Faculty of Science > Research Groups > Computational Biology > Computational biology of RNA (former - to 2018) Faculty of Science > Research Groups > Computational Biology > Phylogenetics (former - to 2018) Faculty of Science > Research Groups > Computational Biology Faculty of Science > Research Groups > Norwich Epidemiology Centre Faculty of Medicine and Health Sciences > Research Groups > Norwich Epidemiology Centre |
| Depositing User: | Pure Connector |
| Date Deposited: | 12 Nov 2014 16:34 |
| Last Modified: | 13 Jun 2023 08:26 |
| URI: | https://ueaeprints.uea.ac.uk/id/eprint/50529 |
| DOI: | 10.1016/j.aim.2014.09.025 |
Actions (login required)
 |
View Item |