Taut Distance-Regular Graphs of Odd Diameter

被引:0
|
作者
Mark S. MacLean
机构
[1] University of North Carolina,
来源
关键词
distance-regular graph; association scheme; bipartite graph; tight graph; taut graph;
D O I
暂无
中图分类号
学科分类号
摘要
Let Γ denote a bipartite distance-regular graph with diameter D ≥ 4, valency k ≥ 3, and distinct eigenvalues θ0 > θ1 > ··· > θD. Let M denote the Bose-Mesner algebra of Γ. For 0 ≤ i ≤ D, let Ei denote the primitive idempotent of M associated with θi. We refer to E0 and ED as the trivial idempotents of M. Let E, F denote primitive idempotents of M. We say the pair E, F is taut whenever (i) E, F are nontrivial, and (ii) the entry-wise product E ○ F is a linear combination of two distinct primitive idempotents of M. We show the pair E, F is taut if and only if there exist real scalars α, β such that
引用
收藏
页码:125 / 147
页数:22
相关论文
共 50 条
  • [41] Tight Distance-Regular Graphs
    Aleksandar Jurišić
    Jack Koolen
    Paul Terwilliger
    Journal of Algebraic Combinatorics, 2000, 12 : 163 - 197
  • [42] Edge-distance-regular graphs are distance-regular
    Camara, M.
    Dalfo, C.
    Delorme, C.
    Fiol, M. A.
    Suzuki, H.
    JOURNAL OF COMBINATORIAL THEORY SERIES A, 2013, 120 (05) : 1057 - 1067
  • [43] Distance-regular graphs of diameter 3 having eigenvalue-1
    Bang, Sejeong
    Koolen, Jack
    LINEAR ALGEBRA AND ITS APPLICATIONS, 2017, 531 : 38 - 53
  • [44] Tight distance-regular graphs
    Jurisic, A
    Koolen, J
    Terwilliger, P
    JOURNAL OF ALGEBRAIC COMBINATORICS, 2000, 12 (02) : 163 - 197
  • [45] CUBIC DISTANCE-REGULAR GRAPHS
    BIGGS, NL
    BOSHIER, AG
    SHAWETAYLOR, J
    JOURNAL OF THE LONDON MATHEMATICAL SOCIETY-SECOND SERIES, 1986, 33 : 385 - 394
  • [46] Twice Q-polynomial distance-regular graphs of diameter 4
    MA JianMin
    KOOLEN Jack H.
    ScienceChina(Mathematics), 2015, 58 (12) : 2683 - 2690
  • [47] Twice Q-polynomial distance-regular graphs of diameter 4
    JianMin Ma
    Jack H. Koolen
    Science China Mathematics, 2015, 58 : 2683 - 2690
  • [48] On bipartite distance-regular graphs with a strongly closed subgraph of diameter three
    Kong, Qian
    Wang, Kaishun
    DISCRETE MATHEMATICS, 2010, 310 (24) : 3523 - 3527
  • [49] Extremal 1-codes in distance-regular graphs of diameter 3
    Jurisic, Aleksandar
    Vidali, Janos
    DESIGNS CODES AND CRYPTOGRAPHY, 2012, 65 (1-2) : 29 - 47
  • [50] A construction of distance-regular graphs from subspaces in d-bounded distance-regular graphs
    Gao, Suogang
    Guo, Jun
    ARS COMBINATORIA, 2011, 98 : 135 - 148