A generalization of both the hierarchical product and the Cartesian product of graphs is introduced and some of its properties are studied. We call it the generalized hierarchical product. In fact, the obtained graphs turn out to be subgraphs of the Cartesian product of the corresponding factors. Thus, some well-known properties of this product, such as a good connectivity, reduced mean distance, radius and diameter, simple routing algorithms and some optimal communication protocols, are inherited by the generalized hierarchical product. Besides some of these properties, in this paper we study the spectrum, the existence of Hamiltonian cycles, the chromatic number and index, and the connectivity of the generalized hierarchical product. © 2008 Elsevier B.V. All rights reserved.
Barrière, L., Dalfó, C., Fiol, M. A., & Mitjana, M. (2009). The generalized hierarchical product of graphs. Discrete Mathematics, 309(12), 3871–3881. https://doi.org/10.1016/j.disc.2008.10.028