Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published April 11, 2019 | Submitted
Report Open

Extremal Properties of Complex Networks

Abstract

We describe the structure of connected graphs with the minimum and maximum average distance, radius, diameter, betweenness centrality, efficiency and resistance distance, given their order and size. We find tight bounds on these graph qualities for any arbitrary number of nodes and edges and analytically derive the form and properties of such networks.

Attached Files

Submitted - 1104.5532.pdf

Files

1104.5532.pdf
Files (441.2 kB)
Name Size Download all
md5:b0cfba267d1ef652f5a4be14f84ce6a3
441.2 kB Preview Download

Additional details

Created:
August 19, 2023
Modified:
October 20, 2023