Centralities of a network and its line graph: an analytical comparison by means of their irregularity
Authors:
- 24 May 2013
- journal article
- research article
- Published by Taylor & Francis in International Journal of Computer Mathematics
- Vol. 91 (2) , 304-314
Abstract
Given a network G, it is known that the Bonacich centrality of the bipartite graph B(G) associated with G can be obtained in terms of the centralities of the line graph L(G) associated with G and the centrality of the network G+gr (whose adjacency matrix is obtained by adding to the adjacency matrix A(G) the diagonal matrix D=bij, where bii is the degree of node i in G) and conversely. In this contribution, we use the centrality of G to estimate the centrality of G+gr and show that the error committed is bounded by some measure of the irregularity of G. This estimate gives an analytical comparison of the eigenvector centrality of G with the centrality of L(G) in terms of some irregularity measure of G.Keywords
This publication has 15 references indexed in Scilit:
- Analytical relationships between metric and centrality measures of a network and its dualJournal of Computational and Applied Mathematics, 2011
- Eigenvalues and degree deviation in graphsLinear Algebra and its Applications, 2006
- Centrality measures in spatial networks of urban streetsPhysical Review E, 2006
- Complex networks: Structure and dynamicsPhysics Reports, 2006
- The Structure and Function of Complex NetworksSIAM Review, 2003
- Statistical mechanics of complex networksReviews of Modern Physics, 2002
- Eigenvector-like measures of centrality for asymmetric relationsSocial Networks, 2001
- A note on the irregularity of graphsLinear Algebra and its Applications, 1992
- The degree variance: An index of graph heterogeneitySocial Networks, 1981
- Factoring and weighting approaches to status scores and clique identificationThe Journal of Mathematical Sociology, 1972