Directed strongly regular graphs and divisible design graphs from Tatra association schemes
Mikhail Muzychuk, Grigory Ryabov
TL;DR
This paper constructs new directed strongly regular graphs and divisible design graphs using Tatra association schemes, and explores their properties, fusions, and isomorphisms.
Contribution
It introduces novel graphs derived from Tatra association schemes and analyzes their structural relationships and classifications.
Findings
New directed strongly regular graphs with unique parameters
Divisible design graphs with specified properties
Insights into the structure and isomorphisms of Tatra association schemes
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFinite Group Theory Research · Algebraic Geometry and Number Theory · Homotopy and Cohomology in Algebraic Topology