2026-04-14T02:04:21Zhttps://recercat.cat/oai/request

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

urn:hdl:10459.1/463315 On the spectra of hypertrees Barrière, Lali Comellas Padró, Francesc Dalfó, Cristina Fiol Mora, Miguel Ángel Graph operation Hierarchical product Tree Adjacency matrix Spectrum 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. 2008-04-01 info:eu-repo/semantics/article info:eu-repo/semantics/submittedVersion Versió preprint del document publicat a https://doi.org/10.1016/j.laa.2007.09.039 Linear Algebra and Its Applications, 2008, vol. 428, núm. 7, p. 1499-1510 Linear Algebra and Its Applications cc-by-nc-nd, (c) Elsevier, 2008 Attribution-NonCommercial-NoDerivatives 4.0 International info:eu-repo/semantics/openAccess http://creativecommons.org/licenses/by-nc-nd/4.0/ Elsevier