Directed strongly regular graphs and divisible design graphs from Tatra association schemes
Combinatorics
2026-01-19 v2
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.
Keywords
Cite
@article{arxiv.2601.09955,
title = {Directed strongly regular graphs and divisible design graphs from Tatra association schemes},
author = {Mikhail Muzychuk and Grigory Ryabov},
journal= {arXiv preprint arXiv:2601.09955},
year = {2026}
}
Comments
22 pages