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)

Full work available at URL https://doi.org/10.1007/S10623-024-01557-W

zbMATH Keywords

divisible design graphequitable partitionprojective spacespreadsymplectic graph

Mathematics Subject Classification ID

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

Cites work

• A census of small transitive groups and vertex-transitive graphs
• A new construction of strongly regular graphs with parameters of the complement symplectic graph
• Cayley-Deza graphs with fewer than 60 vertices
• Classification of divisible design graphs with at most 39 vertices
• Classification of the (0, 2)-graphs of valency 8
• Deza graphs with parameters (n,k,k-1,a) and =1
• Divisible design graphs
• Divisible design graphs with parameters (4n,n+2,n-2,2,4,n) and (4n,3n-2,3n-6,2n-2,4,n)
• Extremal Peisert-type graphs without the strict-EKR property
• General Galois Geometries
• scientific article; zbMATH DE number 1600999 (Why is no real title available?)
• scientific article; zbMATH DE number 3917102 (Why is no real title available?)
• scientific article; zbMATH DE number 2232233 (Why is no real title available?)
• Minimum supports of eigenfunctions of graphs: a survey
• New constructions of divisible design Cayley graphs
• New versions of the Wallis-Fon-Der-Flaass construction to create divisible design graphs
• On blocking sets of the tangent lines to a nonsingular quadric in \(\text{PG}(3,q), q\) prime
• On divisible design Cayley graphs
• On eigenfunctions and maximal cliques of generalised Paley graphs of square order
• Partitions and their stabilizers for line complexes and quadrics
• Spreads in strongly regular graphs
• Strongly regular graphs
• Strongly regular graphs decomposable into a divisible design graph and a Hoffman coclique
• The pseudo-hyperplanes and homogeneous pseudo-embeddings of the generalized quadrangles of order \((3,t)\)
• The vertex connectivity of some classes of divisible design graphs
• To the theory of \(q\)-ary Steiner and other-type trades
• Walk-regular divisible design graphs

Cited in

(4)

• Divisible design graphs from symplectic graphs over rings with a unique non-trivial ideal
• Divisible design graphs with selfloops
• Tightness of the weight-distribution bound for strongly regular polar graphs
• Divisible design graphs obtained by plugging a difference set into a construction for antipodal distance-regular graphs of diameter 3

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)