Some spectral properties of uniform hypergraphs
Combinatorics
2014-07-22 v1
Abstract
For a -uniform hypergraph , we obtain some trace formulas for the Laplacian tensor of , which imply that () is determined by the Laplacian spectrum of , where is the degree sequence of . 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.
Cite
@article{arxiv.1407.5193,
title = {Some spectral properties of uniform hypergraphs},
author = {Jiang Zhou and Lizhu Sun and Wenzhe Wang and Changjiang Bu},
journal= {arXiv preprint arXiv:1407.5193},
year = {2014}
}