New Computation of Resolving Connected Dominating Sets in Weighted Networks
Published in Entropy
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, ...