Ju l 2 01 0 Networks with the Smallest Average Distance and the Largest Average Clustering

Abstract

We describe the structure of the graphs with the smallest average distance and the largest average clustering given their order and size. There is usually a unique graph with the largest average clustering, which at the same time has the smallest possible average distance. In contrast, there are many graphs with the same minimum average distance, ignoring… (More)

Topics

9 Figures and Tables

Cite this paper

@inproceedings{Murray2010JuL2, title={Ju l 2 01 0 Networks with the Smallest Average Distance and the Largest Average Clustering}, author={Richard M. Murray}, year={2010} }