ABSTRACT

Connectivity is one of the fundamental and central concepts in graph theory. It is important from both a theoretical and a practical point of view. For instance, in order for a communication network or a distributed process to be robust, the underlying graph must have large enough connectivity. Since hypercubes and other products are frequently used models of communication networks, we are thus led to the investigation of the connectivity of Cartesian products.