Rank of adjacency matrices of directed (strongly) regular graphs

If there exists a k-regular directed graph on n vertices such that its adjacency matrix has rank r then kn∈Br. We use this to exclude existence of directed strongly regular graphs for infinitely many feasible parameter sets.