Keynote Speaker:Zhou Sanming

Abstract:

A graph is $G$-arc-transitive if it admits $G$ as a group of automorphisms acting transitively on the set of ordered pairs of adjacent vertices. A project completed recently was to classify $G$-arc-transitive graphs $\Gamma$ with $G$ imprimitive on the vertex set of $\Gamma$ such that the corresponding quotient graph is a complete graph and is almost multi-covered by $\Gamma$. In this talk we will discuss this classification together with related results.

Introduction to the Speaker:

Zhou Sanming, professor of the School of Mathematics and Statistics of University of Melbourne, chairman of the Australian Combinatorics Society, editor-in-chief of Australasian J. Combinatorics, and editor of J. Interconnection Networks (World Scientific) and Bulletin Malays. Math. Sci. Soc. (Springer), won the Kirkman Prize of the Institute of Combinatorics and Its Applications and the title of "Future Researcher" by the Australian Research Council. As an internationally renowned combinatorics mathematician, he mainly studied the research of algebraic graph theory and its applications, random graph process, and network optimization, and has published more than 100 academic papers.

Inviter:

Wang Guanghui Professor of School of Mathematics

Time:

14:00 on November 11 (Wednesday)

Location:

Zoom Meeting, ID: 854 6360 2137, password: 201111

Sponsored by: School of Mathematics, Shandong University