講座主題:Some generalizations of connectivity for some networks
專家姓名:郝榮霞
工作單位:北京交通大學數(shù)學與統(tǒng)計學院
講座時間:2024年12月10日14:00-16:00
講座地點:騰訊會議:835-491-841
主辦單位:煙臺大學數(shù)學與信息科學學院
內(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.
主講人介紹:
郝榮霞,北京交通大學教授, 博士生導師,。主要從事圖論和網(wǎng)絡的研究,,在 IEEE Trans. Comput.、IEEE Trans. Parallel and Distribut. Systems,、Inform. Sci.,、European J. Combin.、J. Graph Theory,、SIAM J. Discrete Math.等國內(nèi)外學術期刊上發(fā)表論文 100 余篇,。主持和參加國家自然科學基金面上項目多項。參加國家自然基金重點項目兩項,。第八屆國際華人數(shù)學家大會做 45 分鐘邀請報告,。曾獲北京市高等教育教學成果一等獎,、北京運籌學會青年優(yōu)秀論文一等獎,北京交通大學“巾幗十杰”,、“畢業(yè)生我最敬愛的教師”,、“教學名師”和 “智瑾獎教金優(yōu)秀教師獎”等獎項。