A directed strongly regular graph with parameters 
is a simple
directed graph on 
vertices having constant indegree and outdegree 
and adjacency matrix 
satisfying
 |
where 
is the identity matrix and 
is the unit matrix (Brouwer
and Gyürki 2026). Opposite directed edges are
allowed.
Brouwer and Gyürki (2026) enumerated, up to graph isomorphism, the 728 vertex-transitive
directed strongly regular graphs with parameters 
satisfying 
, 
, and 
. Here 
is the number of neighbors joined in both directions at each
graph vertex. This is a restricted enumeration, not
an enumeration of all directed strongly regular graphs in this range.
