Joins of hypergraphs and their spectra (Q2197129)

The authors generalise several graph operations to hypergraphs and compute the eigenvalues and characteristic polynomials of the adjacency matrices associated to the resulting hypergraphs. Unfortunately, some typos, spelling mistakes, and inaccuracies make the article hard to read and understand. The authors start with a general introduction where basic concepts are given. Afterwards, the adjacency matrix of a hypergraph is defined. In this definition, it is not clear what the values of the diagonal entries should be. In later results, it is assumed that they are zero, which is also the standard definition for graphs. Using the adjacency matrix of a hypergraph the authors define equitable partitions of a hypergraph. As a first result, they show that the orbits of any subgroup of the automorphism group of a hypergraph form an equitable partition. In the following section, joins of hypergraphs are defined and the eigenvalues of the resulting adjacency matrices are calculated. Furthermore, the authors compute the characteristic polynomial of the complete $m$-uniform $k$-partite hypergraph \(K^{m}_{n_1, n_2, \ldots, n_k}\). In the fourth section, the authors define the generalised corona of a set of hypergraphs and the edge corona of a set of hypergraphs. They express the characteristic polynomials of the hypergraphs resulting by these operations in terms of the adjacency matrices of the underlying hypergraphs. The authors conclude the article by computing the eigenvalues of the adjacency matrix of s-loose cycles \(C^{(m)}_{L(s;n)}\) and s-loose paths \(P^{(m)}_{L(s;n)}\) for the cases \(m=2s\) and \(m\geq 2s+1\) using the previous results.