论文信息 - Relating centralities in graphs and the principal eigenvector of its distance matrix

Relating centralities in graphs and the principal eigenvector of its distance matrix

In this work a new centrality measure of graphs is presented, based on the principal eigenvector of the distance matrix: spectral closeness. Using spectral graph theory, we show some of its properties and we compare the results of this new centrality with closeness centrality. In particular, we prove that for threshold graphs these two centralities always coincide. In addition we construct an infinity family of graphs for which these centralities never coincide.

Renata R. Del-Vecchio | Celso M. da Silva Jr. | Bruno B. Monteiro | R. Del-Vecchio | B. Monteiro

[1] P. Bonacich. Factoring and weighting approaches to status scores and clique identification , 1972 .

[2] A. Barabasi,et al. Lethality and centrality in protein networks , 2001, Nature.

[3] Minimum Distance Spectral Radius of Graphs with Given Edge Connectivity , 2012, 1203.3112.

[4] Brendan D. McKay,et al. Practical graph isomorphism, II , 2013, J. Symb. Comput..

[5] Oliver Hein,et al. Network Centrality and Stock Market Volatility: The Impact of Communication Topologies on Prices , 2012 .

[6] Rosanna Grassi,et al. Extremal Properties of Graphs and Eigencentrality in Trees with a Given Degree Sequence , 2010 .

[7] Gert Sabidussi,et al. The centrality index of a graph , 1966 .

[8] Rosanna Grassi,et al. Some New Results on the Eigenvector Centrality , 2007 .

[9] Alex Bavelas,et al. Communication Patterns in Task‐Oriented Groups , 1950 .

[10] Willem H. Haemers,et al. Spectra of Graphs , 2011 .

[11] David L. Powers,et al. The distance spectrum of the path Pn and The First Distance Eigenvector of Connected Graphs , 1990 .

[12] Bo Zhou,et al. On the distance and distance signless Laplacian spectral radii of bicyclic graphs , 2013 .

[13] Marcia Paiva,et al. Centrality and Betweenness: Vertex and Edge Decomposition of the Wiener Index , 2011 .