Note on Reliability Analysis of Cartesian Product of Networks for Components.

Connectivity is a critical parameter which can measure the reliability of networks. Let T be a vertex set of G. If G − T has at least t components, then T is a t -component cut of G. The t -component connectivity κ t (G) of G is the vertex number of a smallest t -component cut. Cartesian product of graphs is a useful method to construct a large network. We will use Cauchy–Schwarz inequality to determine the component connectivity of Cartesian product of some graphs. [ABSTRACT FROM AUTHOR]