Article
Cited 20 time in 
Cited 20 time in 
Cited 20 time in
Metadata Downloads
Delsarte clique graphs SCIE SCOPUS
- Title
- Delsarte clique graphs
- Authors
- Bang, S; Hiraki, A; Koolen, JH
- Date Issued
- 2007-02
- Publisher
- ACADEMIC PRESS LTD ELSEVIER SCIENCE L
- Abstract
- In this paper, we consider the class of Delsarte clique graphs, i.e. the class of distance-regular graphs with the property that each edge lies in a constant number of Delsarte cliques. There are many examples of Delsarte clique graphs such as the Hamming graphs, the Johnson graphs and the Grassmann graphs. Our main result is that, under mild conditions, for given s >= 2 there are finitely many Delsarte clique graphs which contain Delsarte cliques with size s + I. Further we classify the Delsarte clique graphs with small s. (c) 2005 Elsevier Ltd. All rights reserved.
- Keywords
- DISTANCE-REGULAR GRAPHS; FAMILY
- ISSN
- 0195-6698
- Article Type
- Article
- Citation
- EUROPEAN JOURNAL OF COMBINATORICS, vol. 28, no. 2, page. 501 - 516, 2007-02
- 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