Antipodal distance-regular graphs of diameter four and five

被引：0

作者：

Schade, Tilla

机构：

来源：

Journal of Combinatorial Designs | / 7卷 / 01期

关键词：

D O I：

暂无

中图分类号：

学科分类号：

摘要：

An antipodal distance-regular graph of diameter four or five is a covering graph of a connected strongly regular graph. We give existence conditions for these graphs and show for some types of strongly regular graphs that no nontrivial covers exist.

引用

页码：69 / 77

共 50 条

[21] Taut distance-regular graphs of odd diameter
1600, Kluwer Academic Publishers (17):
[22] Taut distance-regular graphs of odd diameter
MacLean, MS
JOURNAL OF ALGEBRAIC COMBINATORICS, 2003, 17 (02) : 125 - 147
[23] Diameter bounds for geometric distance-regular graphs
Bang, Sejeong
DISCRETE MATHEMATICS, 2018, 341 (01) : 253 - 260
[24] Taut distance-regular graphs of even diameter
MacLean, MS
JOURNAL OF COMBINATORIAL THEORY SERIES B, 2004, 91 (01) : 127 - 142
[25] A Characterization of Distance-Regular Graphs with Diameter Three
Edwin R. van Dam
Willem H. Haemers
Journal of Algebraic Combinatorics, 1997, 6 : 299 - 303
[26] Distance-regular graphs of large diameter that are completely regular clique graphs
Hiroshi Suzuki
Journal of Algebraic Combinatorics, 2018, 48 : 369 - 404
[27] A characterization of distance-regular graphs with diameter three
vanDam, ER
Haemers, WH
JOURNAL OF ALGEBRAIC COMBINATORICS, 1997, 6 (03) : 299 - 303
[28] ON THE MAXIMUM DIAMETER OF A CLASS OF DISTANCE-REGULAR GRAPHS
DAMERELL, RM
GEORGIACODIS, MA
BULLETIN OF THE LONDON MATHEMATICAL SOCIETY, 1981, 13 (JUL) : 316 - 322
[29] Distance-regular graphs of large diameter that are completely regular clique graphs
Suzuki, Hiroshi
JOURNAL OF ALGEBRAIC COMBINATORICS, 2018, 48 (03) : 369 - 404
[30] Improving diameter bounds for distance-regular graphs
Bang, S
Hiraki, A
Koolen, JH
EUROPEAN JOURNAL OF COMBINATORICS, 2006, 27 (01) : 79 - 89

← 1 2 3 4 5 →