Abstract
We propose a simple and natural definition for the Laplacian and the signless Laplacian tensors of a uniform hypergraph. We study their H+-eigenvalues, i.e., H-eigenvalues with nonnegative H-eigenvectors, and H++-eigenvalues, i.e., H-eigenvalues with positive H-eigenvectors. We show that each of the Laplacian tensor, the signless Laplacian tensor, and the adjacency tensor has at most one H++-eigenvalue, but has several other H+-eigenvalues. We identify their largest and smallest H+-eigenvalues, and establish some maximum and minimum properties of these H+-eigenvalues. We then define analytic connectivity of a uniform hypergraph and discuss its application in edge connectivity.
Original language | English |
---|---|
Pages (from-to) | 1045-1064 |
Number of pages | 20 |
Journal | Communications in Mathematical Sciences |
Volume | 12 |
Issue number | 6 |
DOIs | |
Publication status | Published - 27 Mar 2014 |
Keywords
- H -eigenvalue +
- Laplacian tensor
- Signless Laplacian tensor
- Uniform hypergraph
ASJC Scopus subject areas
- General Mathematics
- Applied Mathematics