Directed strongly regular graphs and divisible design graphs from Tatra association schemes
arXiv:2601.09955
Abstract
In this paper, we construct directed strongly regular graphs and divisible design graphs with new parameters merging some basic relations of so-called Tatra associations schemes. We also study the above association schemes, their fusions and isomorphisms.
22 pages