Domination numbers, chromatic numbers and total domination numbers of all powers of paths using an interval graph g

Interval graphs are rich in combinatorial structures and have drawn the attention of research for over number of years. They are extensively studied and revealed their practical relevance for modeling problems arising in the real world. A dominating set is used as a backbone for communication. Among various applications of the theory of domination, chromatic number and total domination the most often discussed is a communication network. The aim of this paper is to find the domination numbers, Chromatic numbers and Total domination numbers of all powers of paths using an interval graph G corresponding to an interval family I using an algorithm.