Deza graphs with parameters (n, k, k-1, a) and β=1

被引:8
|
作者
Goryainov, Sergey [1 ,3 ,4 ]
Haemers, Willem H. [2 ]
Kabanov, Vladislav V. [3 ]
Shalaginov, Leonid [3 ,4 ]
机构
[1] Shanghai Jiao Tong Univ, Shanghai, Peoples R China
[2] Tilburg Univ, Dept Econometr & OR, Tilburg, Netherlands
[3] Krasovskii Inst Math & Mech, Ekaterinburg, Russia
[4] Chelyabinsk State Univ, Chelyabinsk, Russia
基金
俄罗斯科学基金会; 中国国家自然科学基金; 俄罗斯基础研究基金会;
关键词
Deza graph; divisible design graph; dual Seidel switching; involution; strongly regular graph;
D O I
10.1002/jcd.21644
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
A Deza graph with parameters (n, k, b, a) is a k-regular graph with n vertices, in which any two vertices have a or b (a <= b) common neighbours. A Deza graph is strictly Deza if it has diameter 2, and is not strongly regular. In an earlier paper, the two last authors et al characterised the strictly Deza graphs with b = k - 1 and beta > 1, where beta is the number of vertices with b common neighbours with a given vertex. Here, we start with a characterisation of Deza graphs (not necessarily strictly Deza graphs) with parameters (n, k, k - 1, 0). Then, we deal with the case beta = 1 and a > 0, and thus complete the characterisation of Deza graphs with b = k - 1. It follows that all Deza graphs with b = k - 1, beta = 1 and a > 0 can be made from special strongly regular graphs, and in fact are strictly Deza except for K-2. We present several examples of such strongly regular graphs. A divisible design graph (DDG) is a special Deza graph, and a Deza graph with beta = 1 is a DDG. The present characterisation reveals an error in a paper on DDGs by the second author et al. We discuss the cause and the consequences of this mistake and give the required errata.
引用
收藏
页码:188 / 202
页数:15
相关论文
共 50 条
  • [1] On strictly Deza graphs with parameters (n, k, k-1, a)
    Kabanov, V. V.
    Maslova, N. V.
    Shalaginov, L. V.
    [J]. EUROPEAN JOURNAL OF COMBINATORICS, 2019, 80 : 194 - 202
  • [2] On K-1,K-3-free strictly Deza graphs
    Mityanina, A., V
    [J]. TRUDY INSTITUTA MATEMATIKI I MEKHANIKI URO RAN, 2016, 22 (01): : 231 - 234
  • [3] On K-1,K-3-free Deza graphs with diameter greater than 2
    Mityanina, A. V.
    [J]. TRUDY INSTITUTA MATEMATIKI I MEKHANIKI URO RAN, 2014, 20 (02): : 238 - 241
  • [4] LINKING (N-2)-DIMENSIONAL PANELS IN N-SPACE-I - (K-1,K)-GRAPHS AND (K-1,K)-FRAMES
    TAY, TS
    [J]. GRAPHS AND COMBINATORICS, 1991, 7 (03) : 289 - 304
  • [5] On quasi-strongly regular graphs with parameters (n, k, a; k-1, c2)
    Xie, Jiayi
    Jia, Dongdong
    Zhang, Gengsheng
    [J]. DISCRETE MATHEMATICS, 2021, 344 (03)
  • [6] Orthogonal [k-1,k+1]-factorizations in graphs
    Liu, GZ
    Yan, GY
    [J]. JOURNAL OF STATISTICAL PLANNING AND INFERENCE, 1996, 51 (02) : 195 - 200
  • [7] Deza graphs with parameters (v,k,k-2,a)
    Kabanov, Vladislav V.
    Shalaginov, Leonid
    [J]. JOURNAL OF COMBINATORIAL DESIGNS, 2020, 28 (09) : 658 - 669
  • [8] Determination of the sizes of optimal (m, n, k, λ, k-1)-OOSPCs for λ = k-1, k
    Pan, Rong
    Chang, Yanxun
    [J]. DISCRETE MATHEMATICS, 2013, 313 (12) : 1327 - 1337
  • [9] On cyclic 2(k-1)-support (n, k)k-1 difference families
    Momihara, Koji
    [J]. FINITE FIELDS AND THEIR APPLICATIONS, 2009, 15 (04) : 415 - 427
  • [10] The nullity of (k-1)-cyclic graphs
    Tan, Xuezhong
    Liu, Bolian
    [J]. LINEAR ALGEBRA AND ITS APPLICATIONS, 2013, 438 (07) : 3144 - 3153