A Characterization of Distance-Regular Graphs with Diameter Three

被引：0

作者：

Edwin R. van Dam

Willem H. Haemers

机构：

[1] Tilburg University,Department of Econometrics

来源：

Journal of Algebraic Combinatorics | 1997年 / 6卷

关键词：

distance-regular graph; eigenvalues of graphs;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

We characterize the distance-regular graphs with diameter three by giving an expression for the number of vertices at distance two from each given vertex, in terms of the spectrum of the graph.

引用

页码：299 / 303

页数：4

共 50 条

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

← 1 2 3 4 5 →