
158
Complex Networks: An Algorithmic Perspective
Figure 8.10: One-hop clusters with clusterheads
a path between every pair of vertices in the DS. If we can form a DS of a graph
using any of the algorithms described in Section 6.3, we will be able to form one-
hop clusters with CHs where any node v ∈ DS will be a CH and all neighbors of a
CH will be the members of the cluster formed by that CH.
The idea of k-hop cluster formation can be combined with the DS formation to
yield k-hop dominating sets which may be used to form k-hop clusters. A vertex
in a k-hop dominating set is either included in the dominating set or has a distance
of at most