学 术 报 告

报告题目：Constructions of graphs and trees with partially prescribed spectrum

报 告 人：李学良   教授、博士生导师

南开大学组合数学中心副主任

青海师范大学 数学与统计学院经理

时  间： 6月 18 日 （周日）14:00-15:30

报  点： A102教室

Abstract: It is shown how a connected graph and a tree with partially prescribed spectrum can be constructed. These constructions are based on a recent result of Salez that every totally real algebraic integer is an eigenvalue of a tree. Our result implies that for any (not necessarily connected) graph, there is a tree such that the characteristic polynomial of the graph divides the characteristic polynomial of the tree. Some open problems will also be presented in this talk.

欢迎各位老师及同学参加！

数学与计算科学学院