A $k$-regular graphwith $v$ vertices is a {\em divisible design graph with parameters}$(v,k,\lambda_1,\lambda_2,m,n)$ if its vertex set can be partitioned into $m$classes of size $n$ such that any two different vertices from the same classhave $\lambda_1$ common neighbours, and any two vertices from different classeshave  $\lambda_2$ common neighbours.Divisible design graphs were introduced by H. Kharaghani and first provided byW.H. Haemers, H. Kharaghani and M. Meulenberg. In particular, the authors haveproposed several constructions of divisible design graphs using variouscombinatorial structures. Some new combinatorial constructions of divisibledesign graphs were later provided by many authors.In this talk, we present twoprolific constructions that produce infinite series of divisible design graphs.Using affine designs for these constructions develops ideas of W.D. Wallis,D.G. Fon-Der-Flaass, and M. Muzychuk.

Vladislav Kabanovis a Chief Researcher at Krasovskii Institute of Mathematics and Mechanics(Russian Academy of Sciences). His main research interests include finitesimple groups, finite permutation groups, claw-free graphs, strongly regulargraphs, Deza graphs, divisible design graphs, Star graphs, equitable partitionsand eigenfunctions of graphs, Paley graphs and their generalisations.