講座主題：Some generalizations of connectivity for some networks
專家姓名：郝榮霞
工作單位：北京交通大學(xué)數(shù)學(xué)與統(tǒng)計(jì)學(xué)院
講座時(shí)間：2024年12月10日14:00-16:00
講座地點(diǎn)：騰訊會(huì)議：835-491-841
主辦單位：煙臺(tái)大學(xué)數(shù)學(xué)與信息科學(xué)學(xué)院
內(nèi)容摘要：
Given a connected graphG and S?V(G) with 2≤|S|≤|V(G)|, a tree in G is said to be an S-tree if it contains all vertices of S.The k-tree connectivity of a graph Gis defined askk(G)=min{kG(S)| S? V(G) and |S|=k}, wherekG(S) denotes the maximum number of S-trees in G such that every pair of them, say Tand T′, are internally disjoint (i.e., E(T)∩E(T′)=? and V(T)∩V(T′)=S. The k-path connectivity is defined similarly by replacing trees with paths.Inthis talk, some generalizations of connectivity including path connectivity and tree connectivity of networks are given.
主講人介紹：
郝榮霞,，北京交通大學(xué)教授, 博士生導(dǎo)師,。主要從事圖論和網(wǎng)絡(luò)的研究，在 IEEE Trans. Comput.、IEEE Trans. Parallel and Distribut. Systems,、Inform. Sci.,、European J. Combin.,、J. Graph Theory,、SIAM J. Discrete Math.等國內(nèi)外學(xué)術(shù)期刊上發(fā)表論文 100 余篇。主持和參加國家自然科學(xué)基金面上項(xiàng)目多項(xiàng),。參加國家自然基金重點(diǎn)項(xiàng)目兩項(xiàng),。第八屆國際華人數(shù)學(xué)家大會(huì)做 45 分鐘邀請(qǐng)報(bào)告。曾獲北京市高等教育教學(xué)成果一等獎(jiǎng),、北京運(yùn)籌學(xué)會(huì)青年優(yōu)秀論文一等獎(jiǎng),，北京交通大學(xué)“巾幗十杰”、“畢業(yè)生我最敬愛的教師”,、“教學(xué)名師”和 “智瑾獎(jiǎng)教金優(yōu)秀教師獎(jiǎng)”等獎(jiǎng)項(xiàng),。
