Spectral extremal trees with degree-based weights

发布时间：2021-11-25 来源：赢咖3 浏览次数：

Speaker:	李学良	DateTime:	2020年11月29日（周一）下午4：00-5：00
Brief Introduction to Speaker: 李学良，南开大学教授。		Place:	腾讯会议号：533 294 297
Abstract:In recent years, many weighted adjacency matrices from graphs weighted by degree-based indices have been proposed and studied, such as Randic matrix, ABC matrix, AG matrix, etc. For each of them one needs to study its spectral properties, especially spectral radius and the corresponding extremal graphs. However, the used methods look very similar. A natural question is how we can work out a unified method to deal with the spectral problem for these seemingly different kinds of weighted adjacency matrices. This talk will show you a first try to address this question for the spectral extremal trees with degree-based weights.