离散度意义下网络图的优化设计(Ⅱ)

Optimization of network graphs under discreteness(Ⅱ)

研究在离散度意义下网络图的优化设计理论,获得了在连通分支数及网络图顶点数已知的条件下,网络图所具有的最大离散度结构及相应的构造方法,以及在连通分支最大顶点数及网络图顶点数已知的条件下,网络图所具有的最大、最小离散度结构及相应的构造方法.

The optimization problems of network graphs under discreteness theory are studied in detail. In this paper, we obtain the following results: 1)The maximum discreteness and its networks structure are obtained when the number of vertices and components is given; 2)The maximum and the minimum discreteness and its networks structure are obtained when the number of vertices and a largest component are given.