Two kinds of constructions of directed strongly regular graphs (Q2227125): Difference between revisions

A directed strongly regular graph with parameters \( (v,k,\lambda, \mu, t) \) is a graph of order \(v\) in which each vertex is incident with \(t\) undirected edges, \(k-t\) out-coming and \(k-t\) in-coming edges, and for any two distinct vertices \(u\), \(v\), the number of vertices \(z\) such that there is an edge from \(u\) to \(z\) and an edge from \(z\) to \(v\) is \(\lambda\) if there is an edge from \(u\) to \(v\), and is \(\mu\) otherwise. A directed strongly regular graph is thus a generalization of a \((v,k,\lambda,\mu)\)-strongly regular graph; it is considered a genuine directed strongly regular graph if \( 0 < t < k \). \par The paper considers two separate strategies for constructing directed strongly regular graphs from algebraic structures. The first construction relies on partial sum families in local rings and results in \(m\)-Cayley digraphs, i.e., digraphs admitting automorphism groups acting regularly on \(m\) disjoint subsets of partitions of the vertices of the graphs. The partial sum families consist of \(m^2\) subsets of the local rings and serve as the connection sets between \(m\) disjoint copies of the local ring. The second construction is a construction that results in Cayley graphs of semidirect products of the additive groups of finite fields with single automorphisms. \par The partial sum families construction takes advantage of a previously obtained characterization of partial sums that give rise to directed strongly regular graphs, and results in \(16\) new parameter five-tuples that are five-tuples of directed strongly regular graphs of orders less than \(110\). A significant part of the paper is devoted to proving that the constructed partial sum families have the required properties. The Cayley graph construction does not produce new five-tuples.