Distance-sum heterogeneity in graphs and complex networks

DOI10.1016/j.amc.2012.03.091zbMath1266.05018OpenAlexW1505954949MaRDI QIDQ450259

Eusebio Vargas-Estrada, Ernesto Estrada

Publication date: 13 September 2012

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2012.03.091

zbMATH Keywords

distance distributionscomplex networksgraph distancesBalaban indexdistance-sum

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Distance in graphs (05C12)

Related Items (5)

When local and global clustering of networks diverge ⋮ Optimally connected hybrid complex networks with windmill graphs backbone ⋮ On generalized windmill graphs ⋮ Core-satellite graphs: clustering, assortativity and spectral properties ⋮ Robustness on topology reconfiguration of complex networks: an entropic approach

Uses Software

• Python

Cites Work

• Metric structure of random networks
• Complex networks: structure and dynamics
• Statistical mechanics of complex networks
• Emergence of Scaling in Random Networks
• Consensus and Cooperation in Networked Multi-Agent Systems
• Collective dynamics of ‘small-world’ networks
• Exploring complex networks
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Distance-sum heterogeneity in graphs and complex networks