全校師生：
我校定于2019年11月30日舉辦研究生靈犀學(xué)術(shù)殿堂——李書超教授報(bào)告會(huì)，現(xiàn)將有關(guān)事項(xiàng)通知如下：
1.報(bào)告會(huì)簡(jiǎn)介
報(bào)告人：李書超教授
時(shí)間：2019年11月30日（星期六）上午9:30—10:30
地點(diǎn)：友誼校區(qū)誠(chéng)字樓429
報(bào)告題目：Extremal problems on two types of trees with respect to the cover cost and the reverse cover cost
內(nèi)容簡(jiǎn)介：In this talk, we consider two types of interesting trees. The first one is the full binary tree, in which every vertex has degree 1 or 3. The second one isn-vertex tree with given segment sequence. In our talk, we first survey some important results on random walk on graphs. Then we study extremal cover cost and reverse cover cost of trees with given segment sequence. At last we study the extremal problems on full binary trees with respect to the cover cost and the reverse cover cost. Some sharp bounds are established. The corresponding extremal graphs arecharacterized.
2.歡迎各學(xué)院師生前來(lái)聽報(bào)告。報(bào)告會(huì)期間請(qǐng)關(guān)閉手機(jī)或?qū)⑹謾C(jī)調(diào)至靜音模式。
黨委學(xué)生工作部
理學(xué)院
2019年11月25日
報(bào)告人簡(jiǎn)介
李書超，教授、博士生導(dǎo)師。2013年入選“教育部新世紀(jì)優(yōu)秀人才支持計(jì)劃”，2012年主持完成的項(xiàng)目獲湖北省自然科學(xué)獎(jiǎng)。主持國(guó)家級(jí)以及省部級(jí)項(xiàng)目多項(xiàng)。主要從事圖的譜理論、極值圖論等方面的研究。以第一作者或通訊作者身份在European Journal of Combinatorics, Journal of Combinatorial Designs, Electronic Journal of Combinatorics, Discrete Mathematics等30余個(gè)重要國(guó)際SCI期刊上，發(fā)表學(xué)術(shù)論文100余篇。
