Reliability of interconnection networks modeled by Cartesian product digraphs
Chao Yang, Jun‐Ming Xu · Networks · 2008
Abstract We determine that the connectivity and the edge‐connectivity of the Cartesian product G1 × G2 of two strongly connected and finite digraphs G1 and G2 are equal to min{n1κ2,n2κ1,δ + δ , δ + δ } and min{n1λ2,n2λ1, δ + δ , δ + δ }, respectively, where ni, κi, λi, δ , δ are the order, the connectivity, the edge‐connectivity, the minimum out‐degree and the minimum in‐degree of Gi, respectively, for i = 1, 2. © 2008 Wiley Periodicals, Inc. NETWORKS, 2008