报告题目：Directed Strongly Regular Dihedrants。

报告人:冯荣权教授(北京大学)

报告时间：12月4日下午4:00-5:30.

报告地点：数理楼小报告厅145.

报告摘要：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 in-and 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