几类δ(G)≥n-4的图的可靠性研究

Study on Network Reliability of Some Graphs with δ(G)≥n-4

要找出拓扑结构稍复杂的图类中的一致最优图是非常困难的,因此,更多的研究人员开始研究图的局部最优性问题。文章通过研究网络可靠性设计中边不可靠点可靠情况下网络的局部最优性问题,给出了一个边分割集的组合计数公式,同时给出了几类δ(G)≥n-4的图类的局部最优性结果。

It＇s difficult to find the uniformly optimally reliable graph with complex topological structure, and more researchers＇ interests turn to local optimality problem. The local optimality of network, which nodes perfectly reliable and edges fail independently, was discussed. Using a combination enumeration formula of edge cutsets, we gave some results of local optimality network with δ（G）≥n-4.