Divisible design graphs from symplectic graphs over rings with precisely three ideals

TL;DR

This paper introduces two new infinite families of divisible design graphs derived from symplectic graphs over rings with exactly three ideals, expanding the understanding of graph constructions in algebraic combinatorics.

Contribution

It presents novel infinite families of divisible design graphs constructed from symplectic graphs over specific rings, a new approach in algebraic graph theory.

Findings

Constructed two infinite families of divisible design graphs

Utilized symplectic graphs over rings with three ideals

Expanded the catalog of algebraic graph constructions

Abstract

In this paper we construct two new infinite families of divisible design graphs based on symplectic graphs over rings with precisely three ideals.