Southwest Jiaotong University School of Mathematics

信息与计算科学系

首页  >  学术科研  >  信息与计算科学系  >  正文

学术报告:Directed Strongly Regular Dihedrants

来源:代数编码团队   作者:信息与计算科学系     日期:2018-04-08 11:51:48   点击数:  

报告内容:An (n; k; t; lamda ;mu )-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 lambda if there is a directed edge from x to y, and is mu 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 strongly
regular dihedrants will be characterized.

报告人:冯荣权教授

报告人简介:冯荣权教授,1994年7月在中国科学院系统科学研究所获理学博士学位并获得中国科学院院长奖学金,现为北京大学数学科学学院教授、博士生导师、数学系副主任和学位委员会委员,并担任中国数学会理事、北京数学会秘书长、《数学的实践与认识》副主编。冯教授的主要研究方向为密码学与信息安全及代数组合论,曾先后主持或参加多项国家自然科学基金、国家863计划、国家973计划、教育部留学回国人员基金项目,在认证理论、椭圆曲线密码、图论与网络结构等密码理论和代数组合论等方面取得若干国际同行瞩目的成果,在国内外核心期刊或会议上发表论文九十余篇,受到国内外同行的高度评价,发表的论文被多次引用,其中还有数项成果被国内外出版的专著或工具书写入书中。

主持人:周正春教授

报告时间:2018年4月10日(周二)下午4点

报告地点:犀浦校区7503