Some Spectral Properties of Uniform Hypergraphs

Abstract

For a k-uniform hypergraph H, we obtain some trace formulas for the Laplacian tensor of H, which imply that n i=1 d s i (s = 1, . . . , k) is determined by the Laplacian spectrum of H, where d 1 , . . . , d n is the degree sequence of H. Using trace formulas for the Laplacian tensor, we obtain expressions for some coefficients of the Laplacian polynomial of a regular hypergraph. We give some spectral characterizations of odd-bipartite hypergraphs, and give a partial answer to a question posed by Shao et al [17]. We also give some spectral properties of power hypergraphs, and show that a conjecture posed by Hu et al [7] holds under certain conditons.

The Matching Polynomials and Spectral Radii of Uniform Supertrees

“…The following result was obtained by Zhou et.al [34], we will use it in the sequel. Recently, Zhang et.…”

On the Adjacency Spectra of Hypertrees

“…One can show by straightforward induction that a k-tree is a k-cylinder, so its spectrum is symmetric in the above sense. The following result, from [8], shows that power trees have spectra which satisfy a much more stringent condition: they are cyclotomic, in the sense that they belong to R[ζ k ].…”

Equitable partition theorem of tensors and spectrum of generalized power hypergraphs

“…If s = k 2 , then G k, k 2 is odd-bipartite if and only if G is bipartite (see [9]). the spectrum of generalized power hypergraphs have been intensively studied (for example, see [7,9,16,17,20]). Recently, Yuan, Qi and Shao [20] proved the following results, which confirms a conjecture of Hu, Qi and Shao [7].…”