Betweenness centrality of an edge in tree-like components with finite size

DOI10.1088/1751-8113/43/48/485003zbMath1207.68043OpenAlexW2019399527MaRDI QIDQ3066001

Li Wang, Dongchao Guo, Mangui Liang

Publication date: 7 January 2011

Published in: Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/14070dacb8f532c1bc194f712c5c307b66b23bb2

zbMATH Keywords

random networksbetweenness centralityedge betweennessfinite tree-like componentsgenerating function formalism

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Related Items (1)

Average hopcount of the shortest path in tree-like components with finite size

This page was built for publication: Betweenness centrality of an edge in tree-like components with finite size