Minimum Connected Dominating Set for Certain Circulant Networks
N. Parthiban, Indra Rajasingh, R. Sundara Rajan · Procedia Computer Science · 2015
A Minimum Connected Dominating Set is a minimum set of connected nodes such that every other node in the network is one hop connected with a node in this set. In general, the problemis proved to be NP-hard. In this paper we find a Minimum Connected Dominating Set for certain Circulant Networks.