Network descriptors based on betweenness centrality and transmission and their extremal values

DOI10.1016/j.dam.2013.04.005zbMath1285.05081OpenAlexW2118175818MaRDI QIDQ2444560

Gilles Caporossi, Damir Vukičević

Publication date: 10 April 2014

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2013.04.005

zbMATH Keywords

transmissioncommunication networkcentrality betweenness

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Directed graphs (digraphs), tournaments (05C20)

Related Items (5)

Minimum status of series-reduced trees with given parameters ⋮ On the difference between proximity and other distance parameters in triangle-free graphs and \(C_4\)-free graphs ⋮ Unnamed Item ⋮ Minimum status of trees with a given degree sequence ⋮ Which numbers are status differences?

Cites Work

• Unnamed Item
• Proximity and remoteness in graphs: Results and conjectures
• Community structure in social and biological networks

This page was built for publication: Network descriptors based on betweenness centrality and transmission and their extremal values