Affordable Access

Access to the full text

New Computation of Resolving Connected Dominating Sets in Weighted Networks

Authors
  • dapena, adriana
  • iglesia, daniel
  • vazquez-araujo, francisco j.
  • castro, paula m.
Publication Date
Nov 29, 2019
Identifiers
DOI: 10.3390/e21121174
OAI: oai:mdpi.com:/1099-4300/21/12/1174/
Source
MDPI
Keywords
Language
English
License
Green
External links

Abstract

In this paper we focus on the issue related to finding the resolving connected dominating sets (RCDSs) of a graph, denoted by G. The connected dominating set (CDS) is a connected subset of vertices of G selected to guarantee that all vertices in the graph are connected to vertices in the CDS. The connected dominating set with minimum cardinality, or minimum CDS (MCDS), is an adequate virtual backbone for information interchange in a network. When distinct vertices of G have also distinct representations with respect to a subset of vertices in the MCDS, it is said that the MCDS includes a resolving set (RS) of G. With this work, we explore different strategies to find the RCDS with minimum cardinality in complex networks where the vertices have different importances.

Report this publication

Statistics

Seen <100 times