On K-1,K-3-free Deza graphs with diameter greater than 2

被引:0
|
作者
Mityanina, A. V. [1 ]
机构
[1] Chelyabinsk State Univ, Chelyabinsk, Russia
来源
关键词
K-1; K-3-free graphs; Deza graphs; Deza graphs with diameter greater than 2;
D O I
暂无
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
A Deza graph with parameters (v, k, b, a) is a k-regular graph with v vertices where any two vertices have either a or b common neighbors. We describe K-1,K-3-free Deza graphs with diameter greater than 2.
引用
收藏
页码:238 / 241
页数:4
相关论文
共 50 条
  • [31] Derivatives of vitamins K-1 and K-2
    Binkley, SB
    MacCorquodale, DW
    Cheney, LC
    Thayer, SA
    McKee, RW
    Doisy, EA
    [J]. JOURNAL OF THE AMERICAN CHEMICAL SOCIETY, 1939, 61 : 1612 - 1613
  • [32] 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)
  • [33] Minimum independent generalized t-degree and independence number in K-1,K-r+1-free graphs
    Favaron, O
    Redouane, Y
    [J]. DISCRETE MATHEMATICS, 1997, 165 : 253 - 261
  • [34] The isolation of vitamins K-1 and K-2
    McKee, RW
    Binkley, SB
    MacCorquodale, DW
    Thayer, SA
    Doisy, EA
    [J]. JOURNAL OF THE AMERICAN CHEMICAL SOCIETY, 1939, 61 : 1295 - 1295
  • [35] 猜想M(2k,k+1)=3k-1+“(k-1)/2”的反例(英文)
    游 林
    王天明
    [J]. Journal of Mathematical Research with Applications, 2002, (02) : 194 - 196
  • [36] GRAPHS OF ORE-TYPE (K-1) WHICH ARE NOT K-PATH HAMILTONIAN
    ROBERTS, J
    [J]. NOTICES OF THE AMERICAN MATHEMATICAL SOCIETY, 1976, 23 (01): : A37 - A37
  • [37] Contractible edges in k-connected graphs with minimum degree greater than or equal to left perpendicular 3k-1/2 right perpendicular
    Ando, Kiyoshi
    [J]. DISCRETE MATHEMATICS, 2021, 344 (07)
  • [38] The kth prime is greater than k(lnk+lnlnk-1) for k≥2
    Dusart, P
    [J]. MATHEMATICS OF COMPUTATION, 1999, 68 (225) : 411 - 415
  • [39] On the question of the effects of Vitamins K-1 and K-2
    Karrer, P
    Koller, F
    [J]. HELVETICA CHIMICA ACTA, 1943, 26 : 2114 - 2115
  • [40] Equimatchable graphs are C2k+1-free for k ≥ 4
    Dibek, Cemil
    Ekim, Tinaz
    Gozupek, Didem
    Shalom, Mordechai
    [J]. DISCRETE MATHEMATICS, 2016, 339 (12) : 2964 - 2969