Showing papers on "Cartesian product of graphs published in 1997"

TL;DR: The following result is proved: Let (X, 6)= 1-[iel(Xi, 6, ), be a product of a finite number of finite metric spaces, where the distance in X is the sum of the coordinate distances.

TL;DR: A necessary and sufficient condition for the generalized Cartesian product to be strongly perfect is given and the special case is the known theorem concerning the Cartesian Product of two graphs.