الوصف
Domination in graphs has been an extensively researched branch of graph theory. Among the variations of dominations, k-hop domination has been brie?y discussed in the past and it has important applications in communication networks.In this book, we consider the problem of ?nding a minimum k-hop dominating set of interval graphs. For this purpose, we ?rst construct the BFS-tree T with root as 1. After then we identify the main path of the BFS-tree T.