1.西工大数学与统计学院学术报告会简介http://math.nwpu.edu.cn/info/1052/2104.htm
报告人：张赞波教授
时间：2020年11月7日（星期六）11:00-12:00
地点：腾讯会议（会议号：951911387）
报告题目：图的圈点连通度
内容简介：For a connected graph G, a set S of vertices (edges) is a cyclic vertex (edge) cutset if G−S is not connected and at least two components of it contain a cycle. The cyclic vertex (edge) connectivity cκ(G) (cλ(G)) is the cardinality of a minimum cyclic vertex (edge) cutset. While cyclic edge connectivity has been studied for a long time, there has been far less work on the corresponding concept on vertices, i.e. cyclic vertex connectivity. Recently, we exploited the concept of cyclic vertex connectivity from the viewpoint of computation. We developed several algorithms that determine the cyclic vertex connectivity of various kind of (regular) graphs. We will go over the concepts of cyclic edge/vertex connectivity and introduce our algorithms in this talk.
报告人简介
张赞波，广东财经大学教授，广东省“千百十”人才培养工程省级培养对象，先后在中山大学和荷兰特文特大学（University of Twente）获得计算机和应用数学方向博士学位。主要从事图论及其算法等方面研究工作，在SIAM J. Discrete Mathematics, J. Graph Theory等著名国际学术期刊上发表论文二十多篇，完成学术著作两本。在图的匹配理论，路圈理论，图划分算法和连通度算法等方向上取得系列成果，部分基础性成果被相关领域的专著和综述所引用。主持完成广东省自然科学基金项目两项，现主持广东省重点科研项目一项。