题目：Directed Strongly Regular Dihedrants

摘要：An (n, k, t, λ, µ)-directed strongly regular graph is a directed graph with n vertices satisfying (i) each vertex has k out-neighbors and k in-neighbors, including t neighbors counted as both inand out-neighbors of the vertex; and (ii) the number of paths of length two from a vertex x to another vertex y is λ if there is a directed edge from x to y, and is µ otherwise. Such graphs were introduced by Duval in 1988 as one of the possible generalization of classical strongly regular graphs to the directed case. Cayley graphs on dihedral groups are called dihedrants. In this talk, a class of directed strongly regular dihedrants will be characterized.

报告人：冯荣权 教授，北京大学数学科学学院

邀请人：唐元生

时间：2020年7月18日

地点：腾讯会议，ID：811 138 522

欢迎广大师生参加！