Joins of Hypergraphs and Their Spectra

by   Amitesh Sarkar, et al.
Indian Institute of Science Education and Research, kolkata

Here, we represent a general hypergraph by a matrix and study its spectrum. We extend the definition of equitable partition and joining operation for hypergraphs, and use those to compute eigenvalues of different hypergraphs. We derive the characteristics polynomial of a complete m-uniform m-partite hypergraph K^m_n_1,n_2,...,n_m. Studying edge corona of hypergraphs we find the complete spectrum of s-loose cycles C^m_L(s;n) for m ≥ 2s+1 and the characteristics polynomial of a s-loose paths P^(m)_L(s;n). Some of the eigenvalues of P^(m)_L(s;n) are also derived. Moreover, using vertex corona, we show how to generate infinitely many pairs of non-isomorphic co-spectral hypergraphs.


page 1

page 2

page 3

page 4


Complexity of Partitioning Hypergraphs

For a given π=(π_0, π_1,..., π_k) ∈{0, 1, *}^k+1, we want to determine w...

Eigenvalues of some classes of signed complete graphs

In this work, we discuss some properties of the eigenvalues of some clas...

On the Seidel spectrum of threshold graphs

In this paper, we analyse spectral properties of Seidel matrix (denoted ...

Consistency of Spectral Hypergraph Partitioning under Planted Partition Model

Hypergraph partitioning lies at the heart of a number of problems in mac...

Chaining, Group Leverage Score Overestimates, and Fast Spectral Hypergraph Sparsification

We present an algorithm that given any n-vertex, m-edge, rank r hypergra...

Linearly ordered colourings of hypergraphs

A linearly ordered (LO) k-colouring of an r-uniform hypergraph assigns a...

Adjacency Matrix and Co-occurrence Tensor of General Hypergraphs: Two Well Separated Notions

Adjacency and co-occurrence are two well separated notions: even if they...

Please sign up or login with your details

Forgot password? Click here to reset