Functional centrality in graphs
组合数学
2007-05-23 v1 谱理论
摘要
In this paper we introduce the functional centrality as a generalization of the subgraph centrality. We propose a general method for characterizing nodes in the graph according to the number of closed walks starting and ending at the node. Closed walks are appropriately weighted according to the topological features that we need to measure.
引用
@article{arxiv.math/0610141,
title = {Functional centrality in graphs},
author = {J. A. Rodriguez and E. Estrada and A. Gutierrez},
journal= {arXiv preprint arXiv:math/0610141},
year = {2007}
}