On the Hierarchical Product of Graphs and the Generalized Binomial Tree
Tipus de documentArticle
Condicions d'accésAccés obert
In this paper we follow the study of the hierarchical product of graphs, an operation recently introduced in the context of networks. A well-known example of such a product is the binomial tree which is the (hierarchical) power of the complete graph on two vertices. An appealing property of this structure is that all the eigenvalues are distinct. Here we show how to obtain a graph with this property by applying the hierarchical product. In particular, we propose a generalization of the binomial tree and some of its main properties are studied.