]> 2026-06-27T21:18:35+00:00 Extremal Properties of Complex Networks 0 en 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. Dionysios Barmpoutis and Richard M. Murray 2011s bm11-arxiv Technical Report 2016-05-15T06:15:54Z 2457523.7610417 Extremal Properties of Complex Networks Title 102 en Title