The Largest Laplacian and Signless Laplacian H-Eigenvalues of a Uniform Hypergraph

Abstract

In this paper, we show that the largest Laplacian H-eigenvalue of a $k$-uniform nontrivial hypergraph is strictly larger than the maximum degree when $k$ is even. A tight lower bound for this eigenvalue is given. For a connected even-uniform hypergraph, this lower bound is achieved if and only if it is a hyperstar. However, when $k$ is odd, it happens that the largest Laplacian H-eigenvalue is equal to the maximum degree, which is a tight lower bound. On the other hand, tight upper and lower bounds for the largest signless Laplacian H-eigenvalue of a $k$-uniform connected hypergraph are given. For a connected $k$-uniform hypergraph, the upper (respectively lower) bound of the largest signless Laplacian H-eigenvalue is achieved if and only if it is a complete hypergraph (respectively a hyperstar). The largest Laplacian H-eigenvalue is always less than or equal to the largest signless Laplacian H-eigenvalue. When the hypergraph is connected, the equality holds here if and only if $k$ is even and the hypergraph is odd-bipartite.

26 pages, 3 figures

References in corpus (2)

• The Eigenvectors of the Zero Laplacian and Signless Laplacian Eigenvalues of a Uniform Hypergraph
• H${}^{+}$-Eigenvalues of Laplacian and Signless Laplacian Tensors

Cited by in corpus (8)

• H${}^{+}$-Eigenvalues of Laplacian and Signless Laplacian Tensors
• The extremal spectral radii of $k$-uniform supertrees
• Cored Hypergraphs, Power Hypergraphs and Their Laplacian H-Eigenvalues
• MB-tensors and MB0-tensors
• Properties of Some Classes of Structured Tensors
• Regular Uniform Hypergraphs, $s$-Cycles, $s$-Paths and Their largest Laplacian H-Eigenvalues
• Double B-tensor and quasi-double B-tensor
• An Even Order Symmetric B Tensor is Positive Definite