Construction of divisible design graphs using affine designs
Abstract
A k-regular graph on v vertices is a divisible design graph if there exist integers λ1,λ2,m,n such that the vertex set can be partitioned into m classes of size n and any two different vertices from the same class have λ1 common neighbours, and any two vertices from different classes have λ2 common neighbours. In this paper, a new construction that produces divisible design graphs is provided.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.