Speaker：Xueliang Li（Nankai University）

Time：2021-05-17 14:00

Location：Classroom 302 at Teaching Building at Haiyun Campus

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, GA matrix and 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 can we 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. Some open problems will be presented.