Directed strongly regular graphs with rank 6

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.