2000 character limit reached
Directed strongly regular graphs and divisible design graphs from Tatra association schemes
Published 15 Jan 2026 in math.CO | (2601.09955v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.