There are finitely many triangle-free distance-regular graphs with degree 8, 9, or 10

Koolen, J. and Moulton, V. ORCID: https://orcid.org/0000-0001-9371-6435 (2004) There are finitely many triangle-free distance-regular graphs with degree 8, 9, or 10. Journal of Algebraic Combinatorics, 19 (2). pp. 205-217. ISSN 0925-9899

Full text not available from this repository. (Request a copy)

Abstract

In this paper we prove that there are finitely many triangle-free distance-regular graphs with degree 8, 9 or 10.

Item Type:	Article
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:	Vishal Gautam
Date Deposited:	09 Jun 2011 17:51
Last Modified:	18 Jun 2026 15:41
URI:	https://ueaeprints.uea.ac.uk/id/eprint/22438
DOI:	10.1023/B:JACO.0000023006.04375.60

Actions (login required)

View Item