一类图族的局部最优性研究

Study on Locally Optimally Reliable of the Graph Class

网络可靠性设计中,点可靠边不可靠情况下的网络一般可以用一个无向简单图G(V,E)来表示.一般的,并不是所有的图族Ω(n,e)中都可以找到一致最优图,文章给出了特定条件下局部可靠网络的判别方法.

In the design of reliability network,we denote a edge-failed network by undirected graph(G(V,E).In general,Uniformly-most reliable networks do no t always exist,this paper show a method of comparing locally optimally reliable of the graph class.