学术报告第201968期

报告题目：POWER DOMINATOR COLORING OF GRAPHS  

报 告 人：N.G. DAVID

报告时间：2019年11月6日16:00

报告地点：南一楼中311室

报告人简介：N.G. DAVID，博士，教授，博导。1980年毕业于印度马德拉斯大学数学专业，获数学硕士学位；1982年毕业于印度马德拉斯大学理论计算科学专业，获理论计算科学硕士学位；1986年毕业于印度阿拉嘎帕大学计算机应用专业，获计算机应用研究生学历；2002年毕业于印度马德拉斯大学理论计算科学专业，获理论计算科学博士学位。长期从事理论计算科学和图论方面研究，且在该领域单独或与人合作发表期刊论文80余篇。印度马德拉斯基督学院教授，印度计算科学研究协会、离散数学与应用协会、马戈什数学协会会员，任多个期刊责任编辑。

报告摘要：Domination and Colouring are two major areas of research in graph theory with motivations from different directions and applications in various fields. Motivated by the problem of electric power system monitoring with minimum phase measurement units, the concept of power domination was introduced and studied for its properties. A recent direction of research has been to combine the notions of power domination and colouring which will be introduced in this presentation. The power dominator chromatic number is the minimum number of colours required for power dominator colouring. This has been computed for several classes of graphs. A brief discussion of these details will also be done in this presentation.