12月27日 Jia Huang 博士学术报告 (数统学院)

文章作者:  发布时间: 2017-12-26  浏览次数: 10

报 告 人:Jia Huang 博士

报告题目:Domination Ratio of Infinite Circulant Digraphs

报告时间:2017年12月27日(周三)下午16:00

报告地点:静远楼1508报告厅

主办单位:数学与统计学院、科技处

报告人简介:

Dr. Jia Huang

Assistant Professor, Department of Mathematics and Statistics, University of Nebraska at Kearney, 2014-present

Postdoctoral Associate, School of Mathematics, University of Minnesota-Twin Cities, 2013-2014

Ph.D. in Mathematics, University of Minnesota-Twin Cities, 2013

Research interests include Discrete Mathematics and its connections with other fields

报告摘要:

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.