Profiles
Research Units
Publications
Sign Up
Faculty Login
X
Journal Article
Open Access
Minimum Connected Dominating Set for Certain Circulant Networks
Parthiban N
,
Indra Rajasingh
,
Rajan R.S.
Published in Elsevier BV
2015
DOI:
10.1016/j.procs.2015.07.401
Volume: 57
Pages: 587 - 591
Abstract
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.
Download
PDF
Publisher Copy
Cite
Publisher Copy Version
Content may be subject to copyright.
This is a gold open access article.
This is a gold open access article.
PDF
Figures & Tables (3)
References (19)
Journal Details
Authors (1)
About the journal
Journal
Data powered by Typeset
Procedia Computer Science
Publisher
Data powered by Typeset
Elsevier BV
ISSN
1877-0509
Open Access
Yes
Authors (1)
Indra Rajasingh
Mathematics
School of Advanced Sciences
Chennai Campus
Recent publications
Investigating substructures in goal oriented online communities: Case study of Ubuntu IRC
Induced Matching Partition of Petersen and Circulant Graphs
Embedding of special classes of circulant networks, hypercubes and generalized Petersen graphs
Metric dimension of directed graphs
Get all the updates for this publication
Follow