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.
From: Nikita Deniskin [view email]
[v1]
Fri, 12 Nov 2021 21:16:33 UTC (269 KB)
[v2]
Wed, 19 Oct 2022 18:54:44 UTC (272 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。