PUBLISHED PAPERS #4.01
| Yeşim Aygül, Melike Karatay, Onur Ugurlu, Urfat Nuriyev Centrality-Based Approaches for Connected Dominating Set Formation in Complex Networks |
|---|
| Abstract. Identifying a Connected Dominating Set (CDS) is a fundamental problem in complex networks, with significant applications in communication efficiency, infrastructure resilience, and social influence analysis. A CDS is a subset of nodes that dominates the entire network, ensuring that every node is either part of the CDS or adjacent to it while also maintaining connectivity. In this study, we evaluate the effectiveness of traditional centrality metrics—Degree Centrality, Closeness Centrality, Betweenness Centrality, and Eigenvector Centrality —in selecting the smallest CDS across different network types, including road networks, power networks, and social networks. By comparing the CDS sizes obtained using different centrality metrics, we identify which metric is most effective in minimizing the CDS size across various network topologies. Our findings provide helpful information on the role of centrality metrics in CDS formation and their implications across diverse real-world network structures. |
| Keywords: Complex Network, Connected Dominating Set, Centrality Metrics, Network Analyses, Node Ranking |
 Download PDF |
| DOI: |