应数学与统计学院张和平教授和徐守军教授邀请，北京交通大学理学院郝荣霞教授将于2019年9月29日-10月3日访问我校并作学术报告。

报 告：The existence of completely independent spanning trees for some compound graphs

时 间：9月30日下午15:00

地 点：齐云楼911报告厅

摘要：A set of k spanning trees of G is said to be completely independent spanning trees (CISTs for short) if for any two vertices x, y ∈ V (G), the paths joining x and y on the k trees have neither vertex nor edge in common, except x and y.Given two regular graphs G and H such that the vertex degree of G is equal to the number of vertices in H, the compound graph G(H) is constructed by replacing each vertex of G by a copy of H and replacing each edge of G by an additional edge connecting vertices randomly in two corresponding copies of H respectively under the constraint that each vertex in G(H) is incident with only one additional edge exactly. In this talk, a suffiffifficient condition for the existence of k CISTs in a kind of compound graph is given. As applications of the main results, the existences of two CISTs for m ≥ 4, three CISTs for m ≥ 8 and four CISTs for m ≥ 10 in a compound graph $Q_m(K_m）$ are gotten. This is joint work with Xiaowen Qin and Jou-Ming Chang.

欢迎广大师生参加！

报告人简介

郝荣霞，2002年博士毕业于北京交通大学数学系，现为北京交通大学教授、博士生导师。2006.3-2006.9 美国的西弗吉尼亚大学（West Virginia University）数学系，访问学者；2013.8-2014.8 美国的佐治亚理工学院（Georgia Institue of Technology)数学系，访问学者；2017.2.8-2017.2.22斯洛文尼亚普利莫斯卡大学 (university of Primorska, Slovenija )访问。目前的主要研究兴趣集中在图论、网络与组合优化及运筹学中的统计分析。发表SCI学术论文60余篇。

甘肃省应用数学与复杂系统省级重点实验室

数学与统计学院

萃英学院

2019年9月27日