Divisible design graphs derived from collections of affine designs
主 讲 人 ：Vladislav Kabanov 研究员
活动时间：04月14日16时40分
地 点 ：球友会D203报告厅（zoom会议：https://us06web.zoom.us/j/86763384947?pwd=qXhOzOcHvaaiw2jqADI8iqNavdgm14.1 ）
讲座内容：
A divisible design graph is a finite regular graph whose vertex set can be partitioned into classes of equal size, in such a way that the number of common neighbors of two distinct vertices depends only on whether they belong to the same or different classes.
In this talk, we present techniques for generating new infinite families of divisible design graphs derived from collections of affine designs. These collections are arranged according to either the Cayley table of a left quasigroup or based on the incidence matrix of a symmetric $2$-design. Several of the resulting graphs exhibit parameter sets that were previously unknown.
主讲人介绍：
Vladislav V. Kabanov is a Chief Researcher in the Department of Algebra and Topology at the Krasovskii Institute of Mathematics and Mechanics (Ural Branch of the Russian Academy of Sciences) in Yekaterinburg, where he has worked since 1995. He also served as a professor at Ural Federal University from 1985 to 2016.
His recurring research interests include finite group theory and algebraic graph theory. He has authored or co-authored 81 papers, 46 of which were published in international journals such as "Journal of Combinatorial Designs", "Discrete Mathematics", "Electronic Journal of Combinatorics", "Designs, Codes and Cryptography", "Linear Algebra and Its Applications", and "Linear and Multilinear Algebra".