Published April 11, 2019
| Submitted
Report
Open
Extremal Properties of Complex Networks
- Creators
- Barmpoutis, Dionysios
- Murray, Richard M.
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
- Eprint ID
- 94626
- Resolver ID
- CaltechAUTHORS:20190410-120609095
- Created
-
2019-04-11Created from EPrint's datestamp field
- Updated
-
2023-06-02Created from EPrint's last_modified field