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