Spectral properties of general hypergraphs
Combinatorics
2016-05-20 v1
Abstract
In this paper, we investigate spectral properties of the adjacency tensor, Laplacian tensor and signless Laplacian tensor of general hypergraphs (including uniform and non-uniform hypergraphs). We obtain some bounds for the spectral radius of general hypergraphs in terms of vertex degrees, and give spectral characterizations of odd-bipartite hypergraphs.
Cite
@article{arxiv.1605.05942,
title = {Spectral properties of general hypergraphs},
author = {Changjiang Bu and Jiang Zhou and Lizhu Sun},
journal= {arXiv preprint arXiv:1605.05942},
year = {2016}
}