arXiv Analytics

Sign in

arXiv:1407.5193 [math.CO]AbstractReferencesReviewsResources

Some spectral properties of uniform hypergraphs

Jiang Zhou, Lizhu Sun, Wenzhe Wang, Changjiang Bu

Published 2014-07-19Version 1

For a $k$-uniform hypergraph $H$, we obtain some trace formulas for the Laplacian tensor of $H$, which imply that $\sum_{i=1}^nd_i^s$ ($s=1,\ldots,k$) is determined by the Laplacian spectrum of $H$, where $d_1,\ldots,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 \cite{ShaoShanWu}. We also give some spectral properties of power hypergraphs, and show that a conjecture posed by Hu et al \cite{HuQiShao} holds under certain conditons.

Related articles: Most relevant | Search more
arXiv:1404.6430 [math.CO] (Published 2014-04-25)
Bounds on the Number of Edges in Hypertrees
arXiv:1502.06475 [math.CO] (Published 2015-02-17)
Some bounds on the eigenvalues of uniform hypergraphs
arXiv:1005.1392 [math.CO] (Published 2010-05-09)
Overlap properties of geometric expanders