Some spectral properties of uniform hypergraphs

67Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

Abstract

For a k-uniform hypergraph H, we obtain some trace formulas for the Laplacian tensor of H, which imply that ∑ni=1 dsi (s=1,…,k) is determined by the Laplacian spectrum of H, where d1,…,dn 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 (2014). We also give some spectral properties of power hypergraphs, and show that a conjecture posed by Hu et al (2013) holds under certain conditons.

Cite

CITATION STYLE

APA

Zhou, J., Sun, L., Wang, W., & Bu, C. (2014). Some spectral properties of uniform hypergraphs. Electronic Journal of Combinatorics, 21(4). https://doi.org/10.37236/4430

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free