The zero eigenvalue of the Laplacian tensor of a uniform hypergraph
In this paper, the author studies the algebraic multiplicity of the zero Laplacian eigenvalues of a connected uniform hypergraph. We can see the definition of a multi-array \(\mathcal A\) of \(n^k\) entries in \(\mathbb{C}\) at the beginning of Section 2. The notion of eigenvalue and eigenvector of \(\mathcal A\) is given in definition 2.1.\N\NThe definition of \(k\)-uniform hypergraph \(H\) appears at the top of page 1098, as does the definition of the degree of a vertex of \(H\). In definition 2.5 we can see the notion of the adjacency tensor of \(H\) and the Laplacian tensor of \(H\).\N\NThe main result of this paper is Theorem 3.2. It is an important result in this matter.\N\NIn Section 4, the author studies the problem with hyperstars and hyperpaths (definitions at the beginning of Section 4). The main result of this section is Theorem 4.9.\N\NThe proofs of all results of this paper are easy to read. The author finishes the paper with an interesting conjecture. I think this is one of the first of many other works on this interesting subject.
- The Laplacian of a uniform hypergraph
- The eigenvectors associated with the zero eigenvalues of the Laplacian and signless Laplacian tensors of a uniform hypergraph
- Algebraic connectivity of an even uniform hypergraph
- Eigenvectors of Laplacian or signless Laplacian of hypergraphs associated with zero eigenvalue
- Geometric vs algebraic nullity for hyperpaths
- \(H^{+}\)-eigenvalues of Laplacian and signless Laplacian tensors
- A combinatorial method for computing characteristic polynomials of starlike hypergraphs
- A Harary-Sachs theorem for hypergraphs
- A reduction formula for the characteristic polynomial of hypergraph with pendant edges
- Computing hypermatrix spectra with the Poisson product formula
- Eigenvalues of a real supersymmetric tensor
- Eigenvectors of Laplacian or signless Laplacian of hypergraphs associated with zero eigenvalue
- Geometric vs algebraic nullity for hyperpaths
- Ideals, varieties, and algorithms. An introduction to computational algebraic geometry and commutative algebra
- Le formalisme du résultant. (The formalism of resultant)
- Multiplicities of tensor eigenvalues
- Some spectral properties and characterizations of connected odd-bipartite uniform hypergraphs
- Spectra of uniform hypergraphs
- Stickelberger and the Eigenvalue Theorem
- The eigenvectors associated with the zero eigenvalues of the Laplacian and signless Laplacian tensors of a uniform hypergraph
- Using Algebraic Geometry
This page was built for publication: The zero eigenvalue of the Laplacian tensor of a uniform hypergraph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6546562)
