Classical distance-regular graphs of negative type

被引：32

作者：

Weng, CW ^{[1
]}

机构：

[1] Natl Chiao Tung Univ, Dept Appl Math, Hsinchu, Taiwan

来源：

JOURNAL OF COMBINATORIAL THEORY SERIES B | 1999年 / 76卷 / 01期

关键词：

D O I：

10.1006/jctb.1998.1892

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

We prove the following theorem. Theorem. Let Gamma = (X, R) denote a distance-regular graph with classical parameters (d, b, alpha, beta) and d greater than or equal to 4. Suppose b < -1, and suppose the intersection numbers a(1) not equal 0, c(2) > 1. Then precisely one of the following (i) (iii) holds. (i) Gamma is the dual polar graph (2)A(dd-1)(-b). (ii) Gamma is the Hermitian forms graph Her(-b)(d). (iii) alpha = (b - 1)/2, beta = -(1 + b(d))/2, and -b is a power of an odd prime. (C) 1999 Academic Press.

引用

页码：93 / 116

页数：24

共 12 条

[1]

BANNAI E, 1984, BENJAMINCUMMINGS LEC, V58

[2]

Brouwer A.E., 1989, DISTANCE REGULAR GRA

[3] CHARACTERIZATION OF THE ASSOCIATION SCHEMES OF HERMITIAN-FORMS OVER GF2[2] [J].