An Optimal Algorithm to Find Minimum K-hop Dominating Set

By Sukumar Mondal

Domination in graphs has been an extensively researched branch of graph theory. Among the variations of dominations, k-hop domination has been briefly discussed in the past and it has important applications in communication networks.In this book, we consider the problem of finding a minimum k-hop dominating set of interval graphs. For this purpose, we first construct the BFS-tree T with root as 1. After then we identify the main path of the BFS-tree T. Next we find the first member of k-hop dominating set of interval graph, by using some results. Then we find the next member of k-hop dominating set by a procedure FindNext. Here, we proposed an O(n) time algorithm to find a minimum k-hop dominating set of undirected and connected interval graphs with n vertices

• Format: Paperback
• Language: English
• ISBN: 6200248575
• ISBN13: 9786200248572
• Release Date: October 2019
• Publisher: LAP Lambert Academic Publishing
• Length: 64 Pages
• Weight: 0.23 lbs.
• Dimensions: 0.1" x 6.0" x 9.0"