|
|||||
|
|
There are only finitely many distance-regular graphs of fixed valency greater than two |
|
| Authors: | S Bang A Dubickas JH Koolen V Moulton |
| Institution: | 1. Department of Mathematics, Yeungnam University, Gyeongsan-si, Republic of Korea;2. Department of Mathematics and Informatics, Vilnius University, Naugarduko 24 LT-03225 Vilnius, Lithuania;3. Wen-Tsun Wu Key Laboratory of CAS, School of Mathematical Sciences, University of Science and Technology of China, Hefei, 23026, Anhui, China;4. School of Computing Sciences, University of East Anglia, Norwich, NR4 7TJ, UK |
| 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. |
| Keywords: | Distance-regular graphs Bannai&ndash Ito conjecture Sims conjecture Othogonal polynomials Christoffel numbers |
| 本文献已被 ScienceDirect 等数据库收录！ | |