报告题目：Integer Tillings and Domination Ratio
报 告 人：黄佳 副教授
报告摘要：An integer distance digraph is the Cayley graph of the additive group Z of all integers with respect to a finite subset S. The domination ratio of this graph, defined as the minimum density of its dominating sets, is related to some number theory problems, such as tiling the integers and finding the maximum density of a set of integers with missing differences. We precisely determine the domination ratio of the integer distance graph with S = { 1,2, ... ,d-2,s } for any integers d >= 2 and s. Our result implies the domination number of certain finite circulant graphs.
报告时间：2019年6月3日(周一) 17:00-18:00
报告地点：磬苑校区数学科学学院H306
欢迎各位老师、同学届时前往！
科学技术处
2019年6月3日