Classifications of imprimitive symmetric graphs 非本原对称图的分类
主 题: Classifications of imprimitive symmetric graphs 非本原对称图的分类
报告人: Teng Fang 方腾 (Tianjin University 天津大学)
时 间: 2018-02-04 11:00-12:00
地 点: 理科一号楼1493
In this talk, I will introduce complete classifications of two families of imprimitive symmetric graphs. Suppose that Γ is a G-symmetric graph and V(Γ) admits a non-trivial G-invariant partition P. In one case, for any two distinct blocks B, C in P, there is only one vertex in B which has a neighbour in C. In another case, for any two distinct blocks B, C in P, there is a unique vertex in B which has no neighbours in C. This is a joint work with Yuqing Chen, Xingui Fang, Binzhou Xia and Sanming Zhou.