A Bound for the Diameter of Distance-Regular Graphs

被引：0

|

作者：

L. Pyber

机构：

[1] Mathematical Institute of the Hungarian Academy of Sciences; Budapest,

[2] P.O.B. 127,undefined

[3] H–1364 Hungary; E-mail: pyber@math-inst.hu,undefined

来源：

Combinatorica | 1999年 / 19卷

关键词：

AMS Subject Classification (1991) Classes: 05E30, 05C12;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

vertices has diameter at most 5 logn. This essentially settles a problem of Brouwer, Cohen and Neumaier.

引用

收藏

页码：549 / 553

页数：4

相关论文

共 50 条

[1] A bound for the diameter of distance-regular graphs
Pyber, L
[J]. COMBINATORICA, 1999, 19 (04) : 549 - 553
[2] THE DIAMETER OF BIPARTITE DISTANCE-REGULAR GRAPHS
TERWILLIGER, P
[J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 1982, 32 (02) : 182 - 188
[3] A valency bound for distance-regular graphs
Qiao, Zhi
Koolen, Jack
[J]. JOURNAL OF COMBINATORIAL THEORY SERIES A, 2018, 155 : 304 - 320
[4] On geometric distance-regular graphs with diameter three
Bang, Sejeong
Koolen, J. H.
[J]. EUROPEAN JOURNAL OF COMBINATORICS, 2014, 36 : 331 - 341
[5] Taut distance-regular graphs of odd diameter
MacLean, MS
[J]. JOURNAL OF ALGEBRAIC COMBINATORICS, 2003, 17 (02) : 125 - 147
[6] A Characterization of Distance-Regular Graphs with Diameter Three
Edwin R. van Dam
Willem H. Haemers
[J]. Journal of Algebraic Combinatorics, 1997, 6 : 299 - 303
[7] Taut distance-regular graphs of even diameter
MacLean, MS
[J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 2004, 91 (01) : 127 - 142
[8] Diameter bounds for geometric distance-regular graphs
Bang, Sejeong
[J]. DISCRETE MATHEMATICS, 2018, 341 (01) : 253 - 260
[9] Distance-regular graphs of large diameter that are completely regular clique graphs
Hiroshi Suzuki
[J]. Journal of Algebraic Combinatorics, 2018, 48 : 369 - 404
[10] A characterization of distance-regular graphs with diameter three
vanDam, ER
Haemers, WH
[J]. JOURNAL OF ALGEBRAIC COMBINATORICS, 1997, 6 (03) : 299 - 303

← 1 2 3 4 5 →