English
 

讲座题目:Zero-Visibility Cops-and-Robber Problems on Graphs


讲座题目:Zero-Visibility Cops-and-Robber Problems on Graphs

报告人:Boting Yang 教授University of Regina

时间:2017.6.29 15:00-17:00

地点:管理学院202

Title: 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