Directed Strongly Regular Dihedrants

活动时间： 04月27日16时45分       

地            点  ： 公教楼E座408

讲座内容：

Abstract：An -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   to another   vertex is   if   there is a directed edge from to , 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, several   constructions of directed strongly regular dihedrants will be given and two   special directed stronglyregular dihedrants will be characterized.  

主讲人介绍：

冯荣权，北京大学数学科学学院教授、博士生导师、数学系副主任和学位委员要研究方向为密码学与信息安全及代数组合论，曾先后主持或参加多项国家自然科学基金、国家863计划、国家973计划、教育部留学回国人员基金和中央办公厅国家密码发展等基金项目的工作，在认证理论、bent函数、椭圆曲线密码、图论与网络结构等密码理论和代数组合论等方面取得若干国际同行瞩目的成果，包括利用典型群上的几何构作出具有保密功能（甚至具有完善保密性）的认证码、对几类认证码给出了同构分类以及对循环图的几种类型的标准覆盖给出了分类及计数等。在国内外核心期刊上发表论文三十余篇，其中二十多篇被SCI期刊收录，受到国内外同行的高度评价。

发布时间：2018-04-26 16:11:46