学术报告
学术报告:Classification of imprimitive symmetric graphs
编辑:发布时间:2018年03月14日

报告人:方腾博士

              天津大学应用数学中心

题目:Classification of imprimitive symmetric graphs

时间:201803月14日下午16:00

地点:海韵行政楼B313

 

报告摘要:A graph Γ is called G-symmetric if it admits G as a group of automorphisms acting transitively on the set of ordered pairs of adjacent vertices. Suppose that the vertex set V(Γ) admits a nontrivial G-invariant partition P such that for any two distinct blocks B and C of P, either there is exactly one edge of Γ between B and C, or exactly one vertex of B has no neighbour in C. In this talk, I will introduce the classification of such symmetric graphs.

报告人简介:方腾,2011年本科毕业于南开大学,2016年博士毕业于北京大学,现在天津大学应用数学中心做博士后。研究方向为代数组合、代数图论。已在《Discrete Mathematics》、《ELECTRONIC JOURNAL OF COMBINATORICS》、《J. Combin. Theory Ser. A》等期刊上发表多篇学术论文。


联系人:郭淑敏

欢迎广大师生参加!