Tensor join of hypergraphs and its spectra
Abstract: In this paper, we introduce three operations on hypergraphs by using tensors. We show that these three formulations are equivalent and we commonly call them as the tensor join. We show that any hypergraph can be viewed as a tensor join of hypergraphs. Tensor join enable us to obtain several existing and new classes of operations on hypergraphs. We compute the adjacency, the Laplacian, the normalized Laplacian spectrum of weighted hypergraphs constructed by this tensor join. Also we deduce some results on the spectra of hypergraphs in the literature. As an application, we construct several pairs of the adjacency, the Laplacian, the normalized Laplacian cospectral hypergraphs by using the tensor join.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.