Name
Abstract | ||
|---|---|---|
The concept of vertex centrality has long been studied in order to help understand the structure and dynamics of complex networks. It has found wide applicability in practical as well as theoretical areas. Closeness centrality is one of the fundamental approaches to centrality, but one difficulty with using it is that it degenerates for disconnected graphs. Some alternate versions of closeness centrality have been proposed which rectify this problem. This paper points out that these are not true extensions of closeness centrality in the sense that they do not rank the vertices of connected graphs in the same way that closeness centrality does. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1145/2016039.2016119 | ACM Southeast Regional Conference 2005 |
Keywords | Field | DocType |
true extension,closeness centrality,fundamental approach,connected graph,alternate version,theoretical area,disconnected graph,vertex centrality,paper point,complex network,centrality | Network science,Random walk closeness centrality,Computer science,Social network analysis,Network controllability,Centrality,Theoretical computer science,Betweenness centrality,Network theory,Katz centrality | Conference |
Citations | PageRank | References |
2 | 0.43 | 2 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Rong Yang | 1 | 35 | 3.07 |
| Leyla Zhuhadar | 2 | 146 | 17.53 |