摘要
ｎ个结点ｅ条边的简单图的集合记为．设奇数，Ｇ的补图是，则Ｇ是中唯一的一致最可靠图．
Let G be a graph. The nodes of G are perfectly reliable and the edges operate independently of each another, all with the same probability p. The all-terminal reliability R(G,p) is the probability that the surviving edges induce a spanning connected subgraph of G. Letbe an odd integer and .Suppose G is a graph with n nodes and e edges, the complement of G is . Then for all with n nodes and e edges for all .
出处
《漳州师范学院学报（自然科学版）》
2001年第4期1-4,共4页
Journal of ZhangZhou Teachers College（Natural Science)
基金
福建省自然科学基金资助项目
关键词
可靠性
一致最可靠网络
简单图
补图
概率图
all-terminal reliability, uniformly optimally reliable network MR (1991) Subject Classification: 05C90, 90B25
