Divisible design graphs from the symplectic graph

DOI10.1007/S10623-024-01557-WMaRDI QIDQ6985751zbMATH OpenFDO

Authors Bart De Bruyn, Sergey Viktorovich Goryainov, Willem H. Haemers, Leonid Viktorovich Shalaginov

Publication date 12 May 2025

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

zbMATH Keywords

spreadequitable partitionprojective spacesymplectic graphdivisible design graph

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Combinatorial aspects of finite geometries (05B25) Structural characterization of families of graphs (05C75) Polar geometry, symplectic spaces, orthogonal spaces (51A50)

This page was built for publication: Divisible design graphs from the symplectic graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6985751)