Abstract
We generalize Laplacian matrices for graphs to Laplacian tensors for even uniform hypergraphs and set some foundations for the spectral hypergraph theory based upon Laplacian tensors. Especially, algebraic connectivity of an even uniform hypergraph based on Z-eigenvalues of the corresponding Laplacian tensor is introduced and its connections with edge connectivity and vertex connectivity are discussed.
| Original language | English |
|---|---|
| Pages (from-to) | 564-579 |
| Number of pages | 16 |
| Journal | Journal of Combinatorial Optimization |
| Volume | 24 |
| Issue number | 4 |
| DOIs | |
| Publication status | Published - 1 Nov 2012 |
Keywords
- Algebraic connectivity
- Hypergraph
- Tensor
- Z-eigenvalue
ASJC Scopus subject areas
- Discrete Mathematics and Combinatorics
- Applied Mathematics
- Computational Theory and Mathematics
- Computer Science Applications
- Control and Optimization