A note on a family of directed strongly regular graphs (Q1970076): Difference between revisions

A directed strongly regular graph with parameters \((v,k,\mu, \lambda,t)\) is a loopless digraph on \(v\) vertices, whose adjacency matrix A satisfies the matrix equations \(\text{A}^2= t\text{I}+ \lambda\text{A}+ \mu(\text{J}- \text{I}- \text{A})\) and \(\text{JA}= \text{AJ}= k\text{J}\), where J is the all-ones matrix and I the identity matrix. These are equivalent to the more familiar combinatorial conditions. The present paper shows how to construct a new infinite family of directed strongly regular graphs using the directed Cayley graphs.