报告题目：POWER DOMINATOR COLORING OF GRAPHS
报 告 人: N.G. DAVID教授, （University of Madras, India）
报告时间：2019年11月8日16:00
报告地点：南一楼625室
摘要：Labeling of graphs is a widely investigated area of research. Combine the notions of power domination and dominator coloring and introduce a new notion of power dominator coloring which requires every vertex to power dominate all vertices in a color class. Discussions will canter around a special kind of labeling called prime distance labeling of graphs, pointing out which classes of graphs admit such a labeling.
报告人简介: 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.
学院公众号二维码
