CONNECTIVITY IN PRODUCTS OF GRAPHS,
ILLINOIS UNIV URBANA
Pagination or Media Count:
The article describes several products of graphs which generalize the products of Harary and Wilcox. In each case the vertex set of the product is V sub 1 x V sub 2 where V sub 1 and V sub 2 are the vertex sets of the factors, while the edge set of the product is given in terms of the distance functions of the two factors. The boolean operations of Harary and Wilcox are obtained as special cases.
- Theoretical Mathematics