Functional centrality in graphs
Authors: Rodríguez, J. A.1; Estrada, E.2; Gutiérrez, A.
Source: Linear and Multilinear Algebra, Volume 55, Number 3, May 2007 , pp. 293-302(10)
Publisher: Taylor and Francis Ltd
Abstract:
In this article, 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.Keywords: AMS Subject Classification numbers: 05C65; 05C50; 05C12; 05A20; 15A42
Document Type: Research article
DOI: http://dx.doi.org/10.1080/03081080601002221
Affiliations: 1: Department of Computer Engineering and Mathematics, Rovira i Virgili University of Tarragona, Av. Països Catalans 26, 43007 Tarragona, Spain 2: University of Santiago de Compostela, 15706 santiago de composa, Spain
Publication date: 2007-05-01
- In this: publication
- By this: publisher
- In this Subject: Mathematics and Statistics
- By this author: Rodríguez, J. A. ; Estrada, E. ; Gutiérrez, A.

Shopping cart
Receive new issue alert