Analytical relationships between metric and centrality measures of a network and its dual

The centrality and efficiency measures of a network G are strongly related to the respective measures on the dual G ⋆ and the bipartite B ( G ) associated networks. We show some relationships between the Bonacich centralities c ( G ) , c ( G ⋆ ) and c ( B ( G ) ) and between the efficiencies E ( G )...

Full description

Saved in:
Bibliographic Details
Published inJournal of computational and applied mathematics Vol. 235; no. 7; pp. 1775 - 1780
Main Authors Criado, R., Flores, J., García del Amo, A., Romance, M.
Format Journal Article Conference Proceeding
LanguageEnglish
Published Kidlington Elsevier B.V 01.02.2011
Elsevier
Subjects
Computation
Computational efficiency
Computing time
Dual graph
Exact sciences and technology
Mathematical analysis
Mathematical models
Mathematics
Networks
Network’s centrality
Network’s efficiency
Numerical analysis
Numerical analysis. Scientific computation
Sciences and techniques of general use
Network’s centrality
Dual graph
Network’s efficiency
Network's centrality
Numerical analysis
Network's efficiency
Applied mathematics
Online AccessGet full text

Cover

More Information
Summary:The centrality and efficiency measures of a network G are strongly related to the respective measures on the dual G ⋆ and the bipartite B ( G ) associated networks. We show some relationships between the Bonacich centralities c ( G ) , c ( G ⋆ ) and c ( B ( G ) ) and between the efficiencies E ( G ) and E ( G ⋆ ) and we compute the behavior of these parameters in some examples.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0377-0427
1879-1778
DOI:10.1016/j.cam.2010.04.011