Functional centrality in graphs

Simple item page
dc.creatorRodriguez, J. A.
dc.creatorEstrada, E.
dc.creatorGutierrez, A.
dc.date2006-10-04
dc.date.accessioned2026-07-07T07:47:03Z
dc.date.available2026-07-07T07:47:03Z
dc.descriptionIn 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.
dc.identifierhttps://arxiv.org/abs/math/0610141
dc.identifierhttp://arxiv.org/abs/math/0610141
dc.identifierLinear and Multilinear Algebra 55 (3) (2007) 293-302.
dc.identifierdoi:10.1080/03081080601002221
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/124035
dc.subjectCombinatorics
dc.subjectSpectral Theory
dc.subject05C65, 05C50, 05C12, 05A20, 15A42
dc.titleFunctional centrality in graphs
dc.typetext

Files

Collections

arXiv