Article ID: | iaor20126001 |
Volume: | 24 |
Issue: | 4 |
Start Page Number: | 564 |
End Page Number: | 579 |
Publication Date: | Nov 2012 |
Journal: | Journal of Combinatorial Optimization |
Authors: | Qi Liqun, Hu Shenglong |
Keywords: | matrices, graphs |
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.