Article
Cited 5 time in 
Cited 0 time in 
Cited 0 time in
Metadata Downloads
A bound for the number of columns l((c,a,b)) in the intersection array of a distance-regular graph SCIE SCOPUS
- Title
- A bound for the number of columns l((c,a,b)) in the intersection array of a distance-regular graph
- Authors
- Bang, S; Koolen, JH; Moulton, V
- Date Issued
- 2003-10
- Publisher
- ACADEMIC PRESS LTD ELSEVIER SCIENCE L
- Abstract
- In this paper we give a bound for the number l((c,a,b)) of columns (c, a, b)(T) in the intersection array of a distance-regular graph. We also show that this bound is intimately related to the Bannai-Ito conjecture. (C) 2003 Elsevier Ltd. All rights reserved.
- Keywords
- FIXED VALENCY; SUBGRAPHS
- ISSN
- 0195-6698
- Article Type
- Article
- Citation
- EUROPEAN JOURNAL OF COMBINATORICS, vol. 24, no. 7, page. 785 - 795, 2003-10
- Files in This Item:
- There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
Communities & Collection
Related Researcher
- Koolen Jacobus H.KOOLEN, JACOBUS H
- Dept of Mathematics