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. © 2015 The Authors. Published by Elsevier B.V.

Indra Rajasingh

Mathematics

School of Advanced Sciences

Chennai Campus

Parthiban N

Rajan R.S.

Fulltext

Vellore Institute of Technology (VIT) is a private university located in&nbsp;Tamil Nadu, India. Founded in 1984, as Vellore Engineering College, the institution offers 20 undergraduate, 34 postgraduate, four integrated and four research programs. It has campuses in Vellore, Amravati, Bhopal and Chennai.

VIT is one of the top ranked private universities in India according to NIRF, THE and QS Rankings.&nbsp;Govt. of India has recognized&nbsp;VIT, Vellore as an&nbsp;Institution of Eminence. This has allowed VIT to take independent quality initiatives and move up in world ranking.

&nbsp;

&nbsp;

VIT University

Procedia Computer Science

Hypercubes are a very popular model for parallel computation because of their regularity and the relatively small number of interprocessor connections. In this paper, we present an algorithm for embedding special class of circulant networks into their optimal hypercubes with dilation 2 and prove its correctness. Also, we embed special class of circulant networks into special class of generalized Petersen graphs with dilation 2 and vice versa. © 2012 Taylor &amp; Francis.

International Journal of Computer Mathematics

Embedding of special classes of circulant networks, hypercubes and generalized Petersen graphs

Theoretical Computer Science

An exact algorithm for the Maximum Leaf Spanning Tree problem

Journal of Parallel and Distributed Computing

Energy-efficient distributed clustering in wireless sensor networks

IEEE Transactions on Parallel and Distributed Systems

Minimum Connected Dominating Set Using a Collaborative Cover Heuristic for Ad Hoc Sensor Networks

Journal of Computer and System Sciences

FPT algorithms and kernels for the Directed k-Leaf problem

Minimum Connected Dominating Set for Certain Circulant Networks

Journal	Data powered by TypesetProcedia Computer Science
Publisher	Data powered by TypesetElsevier BV
ISSN	1877-0509
Open Access	Yes