On distance-regular graphs with height two, II

被引：1

作者：

Tomiyama, M ^{[1
]}

机构：

[1] Osaka Kyoiku Univ, Div Math Sci, Osaka 582, Japan

来源：

JOURNAL OF ALGEBRAIC COMBINATORICS | 1998年 / 7卷 / 02期

基金：

日本学术振兴会;

关键词：

distance-regular graph; height; Johnson graph; complete multipartite graph;

D O I：

10.1023/A:1008664622576

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

Let Gamma be a distance-regular graph with diameter d greater than or equal to 3 and height h = 2, where h = max{i:p(d,i)(d) not equal 0}. Suppose that for every alpha in Gamma and every beta in Gamma(d)(alpha), the induced subgraph on Gamma(d)(alpha) boolean AND Gamma(2)(beta) is isomorphic to a complete multipartite graph K-tX2 with t greater than or equal to 2. Then d = 4 and Gamma is isomorphic to the Johnson graph J(10, 4).

引用

页码：197 / 220

页数：24

共 13 条

[1] Bannai E., 1984, Algebraic Combinatorics I
[2] Biggs N., 1974, ALGEBRAIC GRAPH THEO
[3] Brouwer A.E., 1989, DISTANCE REGULAR GRA
[4] NEUMAIER A, 1985, J REINE ANGEW MATH, V357, P182
[5] AN APPLICATION OF INTERSECTION DIAGRAMS OF HIGH RANK
NOMURA, K
[J]. DISCRETE MATHEMATICS, 1994, 127 (1-3) : 259 - 264
[6] Smith D. H., 1974, Discrete Mathematics, V10, P167, DOI 10.1016/0012-365X(74)90029-6
[7] A note on association schemes with two P-polynomial structures of type III
Suzuki, H
[J]. JOURNAL OF COMBINATORIAL THEORY SERIES A, 1996, 74 (01) : 158 - 168
[8] BOUNDING THE DIAMETER OF A DISTANCE REGULAR GRAPH BY A FUNCTION OF K(D) .2.
SUZUKI, H
[J]. JOURNAL OF ALGEBRA, 1994, 169 (03) : 713 - 750
[9] BOUNDING THE DIAMETER OF A DISTANCE REGULAR GRAPH BY A FUNCTION OF KD
SUZUKI, H
[J]. GRAPHS AND COMBINATORICS, 1991, 7 (04) : 363 - 375
[10] SUZUKI H, 1993, SUT J MATH, V29, P1

← 1 2 →