Krein parameters and antipodal tight graphs with diameter 3 and 4

被引：30
|
作者：
Jurisic, A
Koolen, J
机构：
[1] IMFM, Nova Gorica, Slovenia
[2] Nova Gorica Polytech, Nova Gorica, Slovenia
[3] Univ Bielefeld, FSP, D-33501 Bielefeld, Germany
来源：
DISCRETE MATHEMATICS | 2002年 / 244卷 / 1-3期
关键词：
Krein parameters; distance-regular graphs; tight graphs; 1-homogeneous graphs; antipodal graphs; locally strongly-regular; Taylor graphs;
D O I：
10.1016/S0012-365X(01)00082-6
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
We determine which Krein parameters of nonbipartite antipodal distance-regular graphs of diameter 3 and 4 can vanish, and give combinatorial interpretations of their vanishing. We also study tight distance-regular graphs of diameter 3 and 4. In the case of diameter 3, tight graphs are precisely the Taylor graphs. In the case of antipodal distance-regular graphs of diameter 4, tight graphs are precisely the graphs for which the Krein parameter q(11)(4) vanishes. (C) 2002 Elsevier Science B.V. All rights reserved.
引用
收藏
页码：181 / 202
页数：22
相关论文
共 50 条
  • [31] Metrically homogeneous graphs of diameter 3
    Amato, Daniela A.
    Cherlin, Gregory
    Macpherson, H. Dugald
    JOURNAL OF MATHEMATICAL LOGIC, 2021, 21 (01)
  • [32] On large bipartite graphs of diameter 3
    Feria-Puron, Ramiro
    Miller, Mirka
    Pineda-Villavicencio, Guillermo
    DISCRETE MATHEMATICS, 2013, 313 (04) : 381 - 390
  • [33] ON MOORE GRAPHS WITH DIAMETER-2 AND DIAMETER-3
    HOFFMAN, AJ
    SINGLETON, RR
    IBM JOURNAL OF RESEARCH AND DEVELOPMENT, 1960, 4 (05) : 497 - 504
  • [34] Factorization of complete graphs into three factors with the smallest diameter equal to 3 or 4
    Vetrik, Tomas
    AUSTRALASIAN JOURNAL OF COMBINATORICS, 2007, 39 : 183 - 190
  • [35] Steiner diameter of 3, 4 and 5-connected maximal planar graphs
    Ali, Patrick
    Mukwembi, Simon
    Dankelmann, Peter
    DISCRETE APPLIED MATHEMATICS, 2014, 179 : 222 - 228
  • [36] Graphs of diameter two with no 4-circuits
    Bondy, JA
    Erdos, P
    Fajtlowicz, S
    DISCRETE MATHEMATICS, 1999, 200 (1-3) : 21 - 25
  • [37] On Simplices in Diameter Graphs in R4
    Kupavskii, A. B.
    Polyanskii, A. A.
    MATHEMATICAL NOTES, 2017, 101 (1-2) : 265 - 276
  • [38] On Frobenius graphs of diameter 3 for finite groups
    Breuer, T.
    Hethelyi, L.
    Horvath, E.
    Kuelshammer, B.
    JOURNAL OF ALGEBRA, 2025, 666 : 507 - 529
  • [39] RAINBOW CONNECTION NUMBER OF GRAPHS WITH DIAMETER 3
    Li, Hengzhe
    Li, Xueliang
    Sun, Yuefang
    DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2017, 37 (01) : 141 - 154
  • [40] Diameter and connectivity of 3-arc graphs
    Knor, Martin
    Zhou, Sanming
    DISCRETE MATHEMATICS, 2010, 310 (01) : 37 - 42
12345