Browse wiki

From MurrayWiki
Jump to: navigation, search
Extremal Properties of Complex Networks
Abstract We describe the structure of connected gra …
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.
the form and properties of such networks.  +
Authors Dionysios Barmpoutis and Richard M. Murray  +
ID 2011s  +
Tag bm11-arxiv  +
Title Extremal Properties of Complex Networks +
Type Technical Report  +
Categories Papers
Modification date
This property is a special property in this wiki.
15 May 2016 06:15:54  +
URL
This property is a special property in this wiki.
http://www.cds.caltech.edu/~murray/preprints/bm11-arxiv.pdf  +
hide properties that link here 
Extremal Properties of Complex Networks + Title
 

 

Enter the name of the page to start browsing from.