Divisible design graphs from symplectic graphs over rings with precisely three ideals
Combinatorics
2024-12-09 v1
Abstract
In this paper we construct two new infinite families of divisible design graphs based on symplectic graphs over rings with precisely three ideals.
Keywords
Cite
@article{arxiv.2412.04962,
title = {Divisible design graphs from symplectic graphs over rings with precisely three ideals},
author = {Anwita Bhowmik and Sergey Goryainov},
journal= {arXiv preprint arXiv:2412.04962},
year = {2024}
}