报告题目 (Title)：森林中极大分离集的计数 (Counting the maximum dissociation sets in forests with fixed order and dissociation number, and beyond)
报告人 (Speaker)：李书超教授（清华大学）
报告时间 (Time)：2023年06月30日(周五) 19:00
报告地点 (Place)：腾讯会议：553-848-443
邀请人(Inviter)：袁西英
主办部门：理学院数学系
报告摘要：An independent set of a graph is a subset of vertices which induces a subgraph of maximum degree 0. A dissociation set of a graph is a subset of vertices which induces a subgraph of maximum degree 1. A maximum dissociation set of a graph is a dissociation set with the maximum cardinality. The dissociation number of a graph is the cardinality of a maximum dissociation set of the graph. In this talk, we mainly consider some counting problems on the maximum dissociation sets of forests. If the time is permitted, we will introduce some new relation between the α-spectral radius and the dissociation number of graphs.
