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