Оn maximal cliques in Paley graphs, generalised Paley graphs and Peisert graphs
小
中
大
发布日期：2025-07-21 14:16:43
In this talk wewill discuss maximal cliques in Paley graphs, generalized Paley graphs, andPeisert graphs. We will consider some constructions of maximal cliques andtheir geometric interpretation. We will also present some results oneigenfunctions in these graphs.
Leonid Shalaginovreceived the Specialist and Ph.D. degrees in mathematics from Chelyabisk StateUniversity, Russia, in 2008 and 2011, respectively. He is currently a Professorwith the Department of Mathematics, Chelyabinsk State University. His researchinterests mainly lie in algebraic graph theory.
学术活动
- 2025/08/08
Veni, Sensi, Vici: Touch, on the Robot Physical Intelligence
- 2025/08/09
豆科植物调控根瘤菌侵染的分子机制研究
- 2025/08/04
第19次JSSC前沿学术沙龙
- 2025/08/03
Advancements in Weighted Incidence Matrix Labelling Methods for Graph Spectral Theory
- 2025/07/23
Оn maximal cliques in Paley graphs, generalised Paley graphs and Peisert graphs
- 2025/07/23
Construction of divisible design graphs using affine designs
