Directed strongly regular graphs with rank 6

被引:2
|
作者
Ma, Junye [1 ]
Zhang, Bicheng [1 ]
Liu, Jinwang [2 ]
Zhao, Jutao [3 ]
机构
[1] Xiangtan Univ, Dept Math & Computat Sci, Xiangtan 411105, Hunan, Peoples R China
[2] Hunan Univ Sci & Technol, Dept Math & Computat Sci, Xiangtan 411201, Hunan, Peoples R China
[3] Changzhi Univ, Dept Math, Changzhi 046001, Shanxi, Peoples R China
关键词
Directed strongly regular graphs; Adjacency matrix; Rank of matrix;
D O I
10.1016/j.disc.2016.10.013
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
In this paper, we study 24 possibilities of directed strongly regular graphs with adjacency matrix of rank 6, our proof is based on two effective algorithms. At last, we get 4 families of directed strongly regular graphs with realizable parameter sets, exclude 20 families of directed strongly regular graphs with feasible parameter sets; partially solve the classification problem of directed strongly regular graphs with adjacency matrix of rank 6. (C) 2016 Elsevier B.V. All rights reserved.
引用
收藏
页码:1367 / 1373
页数:7
相关论文
共 50 条