报告题目：On the Path Cover Number of Connected Quasi-Claw-Free Graphs

报告简介：Detecting vertex disjoint paths is one of the central issues in designing and evaluating an interconnection network. It is naturally related to routing among nodes and fault tolerance of the network. A path cover of a graph $G$ is a spanning subgraph of $G$ consisting of vertex disjoint paths, and a path cover number of $G$ denoted by $p(G)=\min\{|\mathcal{P}|:$ $\mathcal{P}$ is a path cover of $G\}$. In this paper, we show that if the minimum degree sum of an independent set with $k+1$ vertices in a connected quasi-claw-free graph $G$ of order $n$ is no less than $n-k$, then $p(G)\leq k-1$, where $k\geq 2$. Examples illustrate that the degree sum condition in our result is sharp. This is a joint work with Huiqing Liu, Jian Lu and Xiuyu Zhong.

报告人：章舜哲，湖北大学数学与统计学学院，硕士生导师。2015年于华中师范大学获理学博士学位，主要从事互连网络、图论及其应用研究。主持湖北省教育厅青年项目和湖北省科技厅面上项目各1项，已发表SCI检索论文十余篇。

报告时间：2021年12月04日（星期六）上午 10:00-11:00

报告地点：腾讯会议，ID：555 731 600

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

欢迎广大师生参加！