This paper solves two termination problem in network system reliability and k termination problem by routiny matrix and adjacency matrix. The authors also discuss the probability when the network celtexs are connected.

• 在运用路线矩阵法、邻接矩阵法解决网络系统可靠性中的二终端问题和终端问题的基础上，进一步探讨了网络各节点都保持连通的概率。