学术报告
学术报告: A Class of Cayley Graphs with Specified Restricted Edge-connectivity
编辑:发布时间:2015年12月21日

报告人:徐俊明教授

                中国科学技术大学

 

报告题目: A Class of Cayley Graphs with Specified Restricted Edge-connectivity

 

报告时间:20160107日下午15:30

 

报告地点:海韵实验楼105

 

报告联系人:金贤安教授

 

内容摘要:This talk is interested in the restricted edge-connectivity of a connected graph, which is the minimum number of edges whose removal results in disconnected and no isolated vertices. For a connected vertex-transitive graph with degree d, it has been proved that its restricted edge-connectivity is between d and 2d-2, and the lower and upper bounds can be attained. A problem confused us more than 10 years is whether there is such a connected vertex-transitive graph with odd degree d (>4) that its restricted edge-connectivity is d+s for any s in [1, d-3]. This talk constructs such a Cayley graph by using semidirect product of groups with replacement product of graphs.

 

报告人简介:

    徐俊明,中国科学技术大学数学系教授、博士生导师。1977年毕业于中国科学技术大学数学系并留校任教至今,1988于中国科学技术大学数学系研究生毕业,并获硕士学位,1999年晋升教授。

徐俊明教授主要从事组合数学、图论、组合网络理论研究。已发表学术论文188篇,出版著作和教材5部。已培养和正在培养博士研究生20多位。获2007年度“宝钢优秀教师奖”,2009年度中国科学院朱李月华优秀教师奖。教学项目《图论与组合网络理论课程教材建设》获首届中国科学院教学成果二等奖(2008

   徐俊明教授曾任中国运筹学会理事,中国数学会组合与图论专业委员会理事。

 

欢迎广大师生参加!