講座主題：Connectivity, diameter, independence number and the distance spectral radius of graphs
專家姓名：李書超
工作單位：華中師范大學
講座時間：2017年6月30日10:00-11:00
講座地點：數(shù)學學院340
主辦單位：煙臺大學數(shù)學與信息科學學院
內(nèi)容摘要：
The distance spectral radius of a graph is the largest eigenvalue of its distance matrix. Zhang [Linear Algebra Appl. 437 (2012) 1930-1941] determined the n-vertex graphs of given diameter with the minimum distance spectral radius. In this paper, on the one hand, we generalize this result by determining the graphs of order n with given connectivity and diameter having the minimum distance spectral radius; On the other hand, we determine the minimum distance spectral radius of graphs among the n-vertex graphs with given connectivity and independence number, and characterize the corresponding extremal graph. As consequences, we determine the minimum distance spectral radius of graphs among the n-vertex graphs with given connectivity (resp. independence number). All the corresponding extremal graphs are identified, respectively.
主講人介紹：
華中師范大學教授,、博士生導師,。主要從事是圖論與組合數(shù)學的研究工作。在European Journal of Combinatorics, Journal of Combinatorial Designs,，Journal of Combinatorial Optimization等國際SCI期刊發(fā)表學術(shù)論文90余篇,，其中有兩篇論文入選“2008年中國100篇最具影響國際學術(shù)論文”,。2012主持完成的項目“圖的幾類重要不變量研究”獲湖北省自然科學獎；2013年入選“教育部新世紀優(yōu)秀人才支持計劃”。目前主持國家自然科學基金面上項目1項,，曾主持完成國家自然科學基金面上項目和國際合作項目各1項,。
