2013/05/28 by Ernesto Estrada, Estrada, Ernesto
Computer Science · Mathematics · Physics and Astronomy · #Combinatorics (math.CO) #FOS: Computer and information sciences #FOS: Mathematics #FOS: Physical sciences #Graph theory and applications #Physics and Society (physics.soc-ph) #Social and Information Networks (cs.SI) #Topological and Geometric Data Analysis #cs.SI #math.CO #physics.soc-ph #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.1305.6836
8 pages, 2 figures
arxiv created 2013/05/28 · openalex publication_date 2013/05/28 · arxiv updated 2013/05/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
The discriminant power of centrality indices for the degree, eigenvector, closeness, betweenness and subgraph centrality is analyzed. It is defined by the number of graphs for which the standard deviation of the centrality of its nodes is zero. On the basis of empirical analysis it is concluded that the subgraph centrality displays better discriminant power than the rest of centralities. We also propose some new conjectures about the types of graphs for which the subgraph centrality does not discriminate among nonequivalent nodes.