Largest H-eigenvalue of uniform s-hypertrees
The k-uniform s-hypertree G = (V,E) is an s-hypergraph, where 1 ≤ s ≤ k - 1; and there exists a host tree T with vertex set V such that each edge of G induces a connected subtree of T. In this paper, some properties of uniform s-hypertrees are establised, as well as the upper and lower bounds on the largest H-eigenvalue of the adjacency tensor of k-uniform s-hypertrees in terms of the maximal degree Δ. Moreover, we also show that the gap between the maximum and the minimum values of the largest H-eigenvalue of k-uniform s-hypertrees is just Θ(Δ s/k ).
KeywordsLargest H-eigenvalue spectral radius adjacency tensor hypertree
Unable to display preview. Download preview PDF.
This work was supported by the National Natural Science Foundation of China (Grant No. 11471077).
- 11.Lim L. Singular values and eigenvalues of tensors: a variational approach. In: Proc of the IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing (CAMSAP 05). 2005, 129–132Google Scholar