完全二部有向图的强连通可靠性

江汉大学学报（自然科学版） ›› 2012, Vol. 40 ›› Issue (1): 10-12.

完全二部有向图的强连通可靠性

吴颖娟

青海师范大学数学与信息科学系，青海西宁810008

出版日期:2012-02-20 发布日期:2013-11-07
作者简介:吴颖娟单位1987—)，女，硕士生，研究方向:理论计算机。

The Strongly Connected Reliability of Complete Bipartite Digraphs

WU Ying－juan

Department of Mathematics and Information,Qinghai Normal University,Xining 810008,Qinghai,China

Online:2012-02-20 Published:2013-11-07

摘要/Abstract

摘要： 对于一般的有向图，要找到一个有效的算法来计算它的强连通可靠性难度比较大。所以通常只研究可以在多项式时间内计算一些特殊图类的强连通可靠性。J.I.Brown和李晓虎已经得出了完全有向图K的强连通可靠性。本文研究完全二部有向图K的强连通可靠性。

关键词: 完全二部有向图, 强连通, 可靠性

Abstract: For a general digraph, it is very hard to find an effective algorithm to calculate its strongly connected reliability. This paper pay attention to the strongly connected reliability of some special digraphs which can be calculated in polynomial times. J.I.Brown and Xiaohu Li have given the strongly connected reliability of complete digraphs. In this paper, the strongly connected reliability of the complete bipartite digraphs is studied.

Key words: complete bipartite digraphs, strongly connected, reliability

中图分类号:

O157.5

吴颖娟. 完全二部有向图的强连通可靠性[J]. 江汉大学学报（自然科学版）, 2012, 40(1): 10-12.

WU Ying－juan. The Strongly Connected Reliability of Complete Bipartite Digraphs[J]. Journal of Jianghan University(Natural Science Edition), 2012, 40(1): 10-12.

[1]	卢俊辉，刘旗，史丽娟. 基于SD 卡的FAT32 文件系统可靠性设计[J]. 江汉大学学报（自然科学版）, 2021, 49(2): 82-88.
[2]	宋朝河. 基于灰色可靠性分析的效能评估模型在雷达侦察中的应用[J]. 江汉大学学报（自然科学版）, 2009, 37(2): 18-21.