Welcome to the InfoSci Platform
Centrality Metrics-Based Connected Dominating Sets for Real-World Network Graphs

Centrality Metrics-Based Connected Dominating Sets for Real-World Network Graphs

Natarajan Meghanathan, Md Atiqur Rahman, Mahzabin Akhter
Copyright: © 2019 |Pages: 29
ISBN13: 9781522581888|ISBN10: 152258188X|ISBN13 Softcover: 9781522586012|EISBN13: 9781522581895
DOI: 10.4018/978-1-5225-8188-8.ch001
Cite Chapter Cite Chapter

MLA

Meghanathan, Natarajan, et al. "Centrality Metrics-Based Connected Dominating Sets for Real-World Network Graphs." Strategic Innovations and Interdisciplinary Perspectives in Telecommunications and Networking, edited by Natarajan Meghanathan, IGI Global, 2019, pp. 1-29. https://doi.org/10.4018/978-1-5225-8188-8.ch001

APA

Meghanathan, N., Rahman, M. A., & Akhter, M. (2019). Centrality Metrics-Based Connected Dominating Sets for Real-World Network Graphs. In N. Meghanathan (Ed.), Strategic Innovations and Interdisciplinary Perspectives in Telecommunications and Networking (pp. 1-29). IGI Global. https://doi.org/10.4018/978-1-5225-8188-8.ch001

Chicago

Meghanathan, Natarajan, Md Atiqur Rahman, and Mahzabin Akhter. "Centrality Metrics-Based Connected Dominating Sets for Real-World Network Graphs." In Strategic Innovations and Interdisciplinary Perspectives in Telecommunications and Networking, edited by Natarajan Meghanathan, 1-29. Hershey, PA: IGI Global, 2019. https://doi.org/10.4018/978-1-5225-8188-8.ch001

Export Reference

Mendeley
Favorite

Abstract

The authors investigate the use of centrality metrics as node weights to determine connected dominating sets (CDS) for a suite of 60 real-world network graphs of diverse degree distribution. They employ centrality metrics that are neighborhood-based (degree centrality [DEG] and eigenvector centrality [EVC]), shortest path-based (betweenness centrality [BWC] and closeness centrality [CLC]) as well as the local clustering coefficient complement-based degree centrality metric (LCC'DC), which is a hybrid of the neighborhood and shortest path-based categories. The authors target for minimum CDS node size (number of nodes constituting the CDS). Though both the BWC and CLC are shortest path-based centrality metrics, they observe the BWC-based CDSs to be of the smallest node size for about 60% of the real-world networks and the CLC-based CDSs to be of the largest node size for more than 40% of the real-world networks. The authors observe the computationally light LCC'DC-based CDS node size to be the same as the computationally heavy BWC-based CDS node size for about 50% of the real-world networks.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.