Distance-regular Graphs of the Height h

被引：0

作者：

Akira Hiraki

机构：

[1] Division of Mathematical Sciences,

[2] Osaka Kyoiku University,undefined

[3] Kashiwara,undefined

[4] Osaka 582–8582,undefined

[5] Japan. e-mail: hiraki@ikoma.cc.osaka-kyoiku.ac.jp,undefined

来源：

Graphs and Combinatorics | 1999年 / 15卷

关键词：

D O I：

暂无

中图分类号：

学科分类号：

摘要：

The height of a distance-regular graph of the diameter d is defined by h=max{j|pdd,j≠0}. We show that if Γ is a distance-regular graph of diameter d, height h>1 and every pdd,h-graph is a clique, then h∈{d−1,d}.

引用

页码：417 / 428

页数：11