报告题目：POWER DOMINATOR COLORING OF GRAPHS

报 告 人:N.G. DAVID教授,（University of Madras, India）

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

报告地点：南一楼328室

摘要：Motivated by the problem of monitoring the state of an electric power system and modeling this problem by a graph with the vertices representing electrical nodes and the edges, the transmission lines,Haynes et al. introduced a variant of domination, known as power domination. On the other hand the concept of dominator coloring of a graph assigns a proper coloring to the vertices and requires every vertex to dominate a color class consisting of all the vertices with the same color. Distinct prime distance labeling of a graph is a variant recently introduced and investigated. Discussions will be done on this variant and its special features.

报告人简介:Professor N.G. DAVID is the member of Board Studies in School of Science, Tamilnadu Open University, Chennai, the member of Indian Association for Research in Computing Science (IARCS), Academy of Discrete Mathematics and Applications (ADMA) and of Margoschis Mathematics Association.

He received M.Sc, M.Phil and PhD degrees from the University of Madras, India, in 1980 ,1982 and 2002 respectively. In 1986, he receives PGDCA degree from Alagappa University, India. He has 37 years teaching experience and has Guided / Supervised 17 Students for M.Phil Degree and 6 students for Ph. Degree. His main research field is theoretical computer science and Graph Theory. There are 80 research papers (Individual/joint Papers in Journals) , which are publications as acquired through research in the main broad research area of theoretical computer science and graphic.