Simplifying the computation of the spectrum of the complete k-uniform hypergraph

DOI10.1016/J.LAA.2020.03.003MaRDI QIDQ2306299zbMATH OpenOpenAlexFDO

Authors Ya-nan Zheng

Publication date 20 March 2020

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.laa.2020.03.003

zbMATH Keywords

eigenvaluehypergraphpolynomial

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Hypergraphs (05C65) Eigenvalues, singular values, and eigenvectors (15A18)

Review text

A thorough probe on the spectrum of a hypergraph is an upcoming topic of research in the area of hypergraph theory. A knowledge of the spectrum may help to decipher certain attributes of the hypergraph itself. Keeping this in mind several researchers contributed to this line of research. In particular, the problem of determining all the eigenvalues of a general hypergraph is a very difficult. The author of this paper proposes a technique to determine the spectrum of a complete $k$-uniform hypergraph with $n$ vertices. He also constructs the spectrum of a complete 4-uniform hypergraph with $n$ vertices with some examples. The paper is well written and is interesting to read.

Recommendations

• The characteristic polynomial of the complete 3-uniform hypergraph
• Adjacency spectrum of complete 4-uniform hypergraph.
• Accessible spectrum of graphs
• Spectra of uniform hypergraphs
• The spectrum of a class of uniform hypergraphs

Cites work

• Algebraic connectivity of an even uniform hypergraph
• Computing hypermatrix spectra with the Poisson product formula
• Eigenvalues of a real supersymmetric tensor
• scientific article; zbMATH DE number 3443655 (Why is no real title available?)
• Hypergraphs and hypermatrices with symmetric spectrum
• 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
• The Laplacian of a uniform hypergraph

Cited in

(6)

• The spectrum of the vertex quadrangulation of a 4-regular toroidal graph and beyond
• The characteristic polynomial of the complete 3-uniform hypergraph
• Non-uniform hypergraphs
• Computing hypermatrix spectra with the Poisson product formula
• Adjacency spectrum of complete 4-uniform hypergraph.
• All eigenvalues of the power hypergraph and signed subgraphs of a graph

This page was built for publication: Simplifying the computation of the spectrum of the complete \(k\)-uniform hypergraph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2306299)