應(yīng)yl7703永利官網(wǎng)張和平教授和徐守軍教授邀請(qǐng)，北京交通大學(xué)理學(xué)院郝榮霞教授將于2019年9月29日-10月3日訪問我校并作學(xué)術(shù)報(bào)告。

報(bào) 告：The existence of completely independent spanning trees for some compound graphs

時(shí) 間：9月30日下午15:00

地 點(diǎn)：齊云樓911報(bào)告廳

摘要：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.

歡迎廣大師生參加！

報(bào)告人簡(jiǎn)介

郝榮霞，2002年博士畢業(yè)于北京交通大學(xué)數(shù)學(xué)系，現(xiàn)為北京交通大學(xué)教授、博士生導(dǎo)師。2006.3-2006.9 美國的西弗吉尼亞大學(xué)（West Virginia University）數(shù)學(xué)系，訪問學(xué)者；2013.8-2014.8 美國的佐治亞理工學(xué)院（Georgia Institue of Technology)數(shù)學(xué)系，訪問學(xué)者；2017.2.8-2017.2.22斯洛文尼亞普利莫斯卡大學(xué) (university of Primorska, Slovenija )訪問。目前的主要研究興趣集中在圖論、網(wǎng)絡(luò)與組合優(yōu)化及運(yùn)籌學(xué)中的統(tǒng)計(jì)分析。發(fā)表SCI學(xué)術(shù)論文60余篇。

甘肅省應(yīng)用數(shù)學(xué)與復(fù)雜系統(tǒng)省級(jí)重點(diǎn)實(shí)驗(yàn)室

yl7703永利官網(wǎng)

萃英學(xué)院

2019年9月27日