https://murray.cds.caltech.edu/index.php?action=history&feed=atom&title=Extremal_Properties_of_Complex_Networks 2026-05-06T01:51:38Z Revision history for this page on the wiki MediaWiki 1.44.2 https://murray.cds.caltech.edu/index.php?title=Extremal_Properties_of_Complex_Networks&diff=19743&oldid=prev 2016-05-15T06:15:54Z

<p>htdb2wiki: creating page for 2011s_bm11-arxiv.html</p> <p><b>New page</b></p><div>{{HTDB paper<br /> | authors = Dionysios Barmpoutis and Richard M. Murray<br /> | title = Extremal Properties of Complex Networks<br /> | source = arXiv:1104.5532v1 [q-bio.MN]<br /> | year = 2011<br /> | type = Technical Report<br /> | funding = NSF NetSE<br /> | url = http://www.cds.caltech.edu/~murray/preprints/bm11-arxiv.pdf<br /> | abstract = <br /> 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.<br /> <br /> | flags = <br /> | tag = bm11-arxiv<br /> | id = 2011s<br /> }}</div>

Murray