报告题目： Domination Ratio of Infinite Circulant Digraphs

报告人：黄佳  University of Nebraska, Kearney

报告时间：12月25号（周一）下午4:00-5:00

报告地点：1518

摘要： 

An infinite circulant digraph is the Cayley graph of the additive group Z of all integers with respect to some finite subset S of Z. The minimum density of a dominating set in this graph is called its domination ratio. We establish some basic results on the domination ratio of this graph and precisely determine it when S consists of two integers s and t with t dividing s. This is joint work with James Carraher.