讲座题目：Zero-Visibility Cops-and-Robber Problems on Graphs 2017-06-26 讲座题目：Zero-Visibility Cops-and-Robber Problems on Graphs报告人：Boting Yang 教授，University of Regina时间：2017.6.29 15:00-17:00地点：管理学院202Title: Zero-Visibility Cops-and-Robber Problems onGraphs基于图论的警察小偷博弈模型Abstract: In this talk, we consider the zero-visibilitycops and robber game. We show that the zero-visibility cop-number of a graph isbounded above by its pathwidth and cannot be bounded below by any nontrivialfunction of the pathwidth. As well, we define a monotonic version of this gameand show that the monotonic zero-visibility cop-number can be bounded bothabove and below by positive multiples of the pathwidth.欢迎广大师生参与！管理科学系2017.6.26