Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
5776814 | Discrete Mathematics | 2017 | 7 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Junye Ma, Bicheng Zhang, Jinwang Liu, Jutao Zhao,