江汉大学学报：自然科学版2012，Vol.40Issue(1)：10-12,3.
完全二部有向图的强连通可靠性
The Strongly Connected Reliability of Complete Bipartite Digraphs
吴颖娟1
作者信息
- 1. 青海师范大学数学与信息科学系,青海西宁810008
- 折叠
摘要
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分类
数理科学引用本文复制引用
吴颖娟..完全二部有向图的强连通可靠性[J].江汉大学学报：自然科学版,2012,40(1):10-12,3.
