摘要
为精确估计网络的可靠度,我们需要最优化其图模型的限制边连通度.本文证明了一个n阶连通图,当n≥10且最小度至少为﹂n/2」-2时,在一定的条件下这个图是λ3-最优的,并举例说明了这些条件的下界是最好可能的.
In order to estimate the security of network more accurately, we need optimize the restricted edge connectivity of the graph model. In this artical we prove that for a connected graph of order n ≥10, if the minimum degree of the graph is at least [ n/2]- 2 then the graph is λ3-optimal in another condition;Some examples are given to show that the bounds of these conditions are best possible.
出处
《山东师范大学学报（自然科学版）》
CAS
2008年第2期1-3,共3页
Journal of Shandong Normal University(Natural Science)
