复杂网络的极值性质
Extremal Properties of Complex Networks
摘要：
给出了连通图的最小和最大平均距离、半径、直径、介数、中心度、效率和阻力距离，并给出了它们的阶和大小。我们发现这些图的质量上的任何任意数量的节点和边缘的紧界和解析推导出这样的网络的形式和性质。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
