|
Abstract:
|
A generalization of both the hierarchical product and the Cartesianproduct of graphs is introduced and some of its properties arestudied. We call it the generalized hierarchical product. In fact,the obtained graphs turn out to be subgraphs of the Cartesianproduct of the corresponding factors. Thus, some well-knownproperties of this product, such as a good connectivity, reducedmean distance, radius and diameter, simple routing algorithms andsome optimal communication protocols, are inherited by thegeneralized hierarchical product. Besides some of these properties,in this paper we study the spectrum, the existence of Hamiltoniancycles, the chromatic number and index, and the connectivity of thegeneralized hierarchical product. |