New results and open problems on subgraph centrality
arXiv:2111.06944 · doi:10.4310/JOC.2023.v14.n4.a2
Abstract
Subgraph centrality, introduced by Estrada and Rodríguez-Velázquez in [12], has become a widely used centrality measure in the analysis of networks, with applications in biology, neuroscience, economics and many other fields. It is also worthy of study from a strictly mathematical point of view, in view of its connections to topics in spectral graph theory, number theory, analytic matrix functions, and combinatorics. In this paper we present some new results and a list of open questions about subgraph centrality and other node centrality measures based on graph walks.
arXiv comment22 pages, 4 figures
References in corpus (6)
- Subgraph Centrality in Complex Networks
- The Physics of Communicability in Complex Networks
- Statistical-mechanical approach to subgraph centrality in complex networks
- Strongly Cospectral Vertices
- Discriminating Power of Centrality Measures
- Vertex distinction with subgraph centrality: a proof of Estrada's conjecture and some generalizations