A bound for the number of columns l(c,a,b) in the intersection array of a distance-regular graph

S. Bang; J. Koolen; V. Moulton

doi:10.1016/S0195-6698(03)00092-1

A bound for the number of columns l(c,a,b) in the intersection array of a distance-regular graph

S. Bang
, J. Koolen
, V. Moulton

Research output: Contribution to journal › Article › peer-review

5 Citations (Scopus)

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.

Original language	English
Pages (from-to)	785-795
Number of pages	11
Journal	European Journal of Combinatorics
Volume	24
Issue number	7
DOIs	https://doi.org/10.1016/S0195-6698(03)00092-1
Publication status	Published - Oct 2003

Access to Document

10.1016/S0195-6698(03)00092-1Licence: Other

Cite this

@article{5da81a54f514438ebab920a0f22dc150,

title = "A bound for the number of columns l(c,a,b) in the intersection array of a distance-regular graph",

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{\textendash}Ito conjecture.",

author = "S. Bang and J. Koolen and V. Moulton",

year = "2003",

month = oct,

doi = "10.1016/S0195-6698(03)00092-1",

language = "English",

volume = "24",

pages = "785--795",

journal = "European Journal of Combinatorics",

issn = "0195-6698",

publisher = "Academic Press",

number = "7",

}

TY - JOUR

T1 - A bound for the number of columns l(c,a,b) in the intersection array of a distance-regular graph

AU - Bang, S.

AU - Koolen, J.

AU - Moulton, V.

PY - 2003/10

Y1 - 2003/10

N2 - 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.

AB - 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.

U2 - 10.1016/S0195-6698(03)00092-1

DO - 10.1016/S0195-6698(03)00092-1

M3 - Article

SN - 0195-6698

VL - 24

SP - 785

EP - 795

JO - European Journal of Combinatorics

JF - European Journal of Combinatorics

IS - 7

ER -