报告题目：On the spectral radius of graphs without linear forests and star forests
报告人：陈明珠
邀请人：刘乐乐
摘要：The Tur\'an type problems ask to maximize the number of edges over all graphs which do not contain a graph $F$ as a subgraph. Similarly, their spectral counterparts ask to maximize the spectral radius of all graphs which do not contain a graph $F$ as a subgraph. In this talk, we present the sharp upper bounds of the spectral radius of all graphs which do not contain a linear forest and a star forest as a subgraph and characterize all the extremal graphs attaining the upper bounds, respectively.
报告时间：2023 年 4 月 2 日 9: 00
腾讯会议：683-339-067
报告人简介：陈明珠, 海南大学开云·电竞(中国)官方网站副教授, 2019 年获上海交通大学博士学位。主要从事代数图论, 特别是谱 Tur\'an 型问题的研究。主持国家自然科学基金青年项目和海南省自然科学基金高层次人才项目。在 Discrete Mathematics, Linear Algebra and its Applications,Linear and MultilinearAlgebra 等杂志发表 SCI 论文多篇。