报告题目：The Aα-spectral radius and k-matching number in graphs

报告简介：A k-matching is a subgraph induced by the edges with weight among 0,1,⋯,k such that ∑e~vfe≤k for every vertex v∈V(G). when k is odd, we give a relationship between Aα-spectral radius and integer k-matching number in general graphs by using the analogous approach given by R. F. Liu et al. (2020).

报告人：李振，贵州大学博士，主要从事图论研究。

报告时间：2021年12月3日（星期五）下午 7:30-8:30.

报告地点：腾讯会议，ID：117 428 293

主办单位：扬州大学数学科学学院

欢迎广大师生参加！