pith. sign in

arxiv: 1711.01466 · v1 · pith:S43ZUD2Xnew · submitted 2017-11-04 · 🧮 math.SP

On the Adjacency Spectra of Hypertrees

classification 🧮 math.SP
keywords uniformhypertreehypertreestreesadjacencycharacterizationconcludeconnected
0
0 comments X
read the original abstract

We extend the results of Zhang et al. to show that $\lambda$ is an eigenvalue of a $k$-uniform hypertree $(k \geq 3)$ if and only if it is a root of a particular matching polynomial for a connected induced subtree. We then use this to provide a spectral characterization for power hypertrees. Notably, the situation is quite different from that of ordinary trees, i.e., $2$-uniform trees. We conclude by presenting an example (an $11$ vertex, $3$-uniform non-power hypertree) illustrating these phenomena.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.