Delsarte clique graphs

被引：21

作者：

Bang, S.

Hiraki, A.

Koolen, J. H.

机构：

[1] Kyushu Univ, Fac Math, Grad Sch, Fukuoka 8128581, Japan

[2] Osaka Kyoiku Univ, Div Math Scu, Kashiwara, Osaka 5828582, Japan

[3] Pohang Univ Sci & Technol, Dept Math, Namgu Pohang 790784, South Korea

来源：

EUROPEAN JOURNAL OF COMBINATORICS | 2007年 / 28卷 / 02期

关键词：

D O I：

10.1016/j.ejc.2005.04.015

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

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.

引用

页码：501 / 516

页数：16

共 8 条

[1]

BROUWER A, 1992, EUR J COMBIN, V13, P71

[2]

Brouwer A.E., 1989, DISTANCE REGULAR GRA

[3] A new distance-regular graph associated to the Mathieu group M10 [J].

Brouwer, AE ;

Koolen, JH ;

Riebeek, RJ .

JOURNAL OF ALGEBRAIC COMBINATORICS, 1998, 8 (02) :153-156

[4]

GODSIL CD, 1993, ALGEBRAIC COMINATORI

[5]

HIRAKI A, 2004, J ALGEBR COMB, V20, P87

[6]

Koolen JH, 1998, COMBINATORICA, V18, P227, DOI 10.1007/PL00009818

[7]

Seidel JJ., 1968, Linear Algebra Appl, V1, P281, DOI [DOI 10.1016/0024-3795(68)90008-6, 10.1016/0024-3795(68)90008-6]

[8] A new family of distance-regular graphs with unbounded diameter [J].

van Dam, ER ;

Koolen, JH .

INVENTIONES MATHEMATICAE, 2005, 162 (01) :189-193

← 1 →