Reliability of interconnection networks modeled by Cartesian product digraphs

  • Authors:

  • Chao Yang;Jun-Ming Xu

  • Affiliations:

  • Department of Mathematics, University of Science and Technology of China, Hefei 230026, China;Department of Mathematics, University of Science and Technology of China, Hefei 230026, China

  • Venue:
  • Networks
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

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,δ +1 + δ +2, δ -1 + δ -2} and min{n1λ2,n2λ1, δ +1 + δ +2, δ -1 + δ -2}, respectively, where ni, κi, λi, δ +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