2026-04-17T15:43:18Zhttps://recercat.cat/oai/request

oai:recercat.cat:10459.1/4633152025-09-15T18:45:19Zcom_2072_3622col_2072_479130

00925njm 22002777a 4500 dc Barrière, Lali author Comellas Padró, Francesc author Dalfó, Cristina author Fiol Mora, Miguel Ángel author 2008-04-01 In this paper, we study the spectral properties of a family of trees characterized by two main features: they are spanning subgraphs of the hypercube, and their vertices bear a high degree of (connectedness) hierarchy. Such structures are here called binary hypertrees and they can be recursively defined as the so-called hierarchical product of several complete graphs on two vertices. Research supported by the Ministry of Education and Science (Spain) and the European Regional Development Fund (ERR) under projects MTM2005-08990-C02-01 and TEC2005-03575 and by the Catalan Research Council under project 2005SGR00256. Graph operation Hierarchical product Tree Adjacency matrix Spectrum On the spectra of hypertrees