Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4602730 | Linear Algebra and its Applications | 2008 | 12 Pages |
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Algebra and Number Theory