On some building blocks of hypergraphs

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Banerjee, Anirban, Parui, Samiron
Format: Preprint
Published: 2022
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866917813392769024
author Banerjee, Anirban
Parui, Samiron
author_facet Banerjee, Anirban
Parui, Samiron
contents In this study, we explore the interrelation between hypergraph symmetries represented by equivalence relations on the vertex set and the spectra of operators associated with the hypergraph. We introduce the idea of equivalence relation compatible operators related to hypergraphs. Some eigenvalues and the corresponding eigenvectors can be computed directly from the equivalence classes of the equivalence relation. The other eigenvalues can be computed from a quotient operator obtained by identifying each equivalence class as an element. We provide an equivalence relation $\mathfrak{R}_s$ on the vertex set of a hypergraph such that the Adjacency, Laplacian, and signless Laplacian operators associated with that hypergraph become $\mathfrak{R}_s$-compatible. The $\mathfrak{R}_s$-equivalence classes are named as units. Using units, we find some more symmetric substructures of hypergraphs called twin units, regular sets, co-regular sets, and symmetric sets. We collectively classify them as building blocks of hypergraphs. We show that the presence of these building blocks leaves certain traces in the spectrum and the corresponding eigenspaces of the $\mathfrak{R}_s$-compatible operators associated with the hypergraph. We also show that, conversely, some specific footprints in the spectrum and the corresponding eigenvectors retrace the presence of some of these building blocks in the hypergraph. Besides the spectra of $\mathfrak{R}_s$-compatible operators, building blocks are also interrelated with hypergraph colouring, distances in hypergraphs, hypergraph automorphisms, and random walks on hypergraphs.
format Preprint
id arxiv_https___arxiv_org_abs_2206_09764
institution arXiv
publishDate 2022
record_format arxiv
spellingShingle On some building blocks of hypergraphs
Banerjee, Anirban
Parui, Samiron
Combinatorics
Primary 05C65, 05C69, 05C15, 05C50, Secondary 05C12, 05C70, 05C81, 05C30, 05C07
In this study, we explore the interrelation between hypergraph symmetries represented by equivalence relations on the vertex set and the spectra of operators associated with the hypergraph. We introduce the idea of equivalence relation compatible operators related to hypergraphs. Some eigenvalues and the corresponding eigenvectors can be computed directly from the equivalence classes of the equivalence relation. The other eigenvalues can be computed from a quotient operator obtained by identifying each equivalence class as an element. We provide an equivalence relation $\mathfrak{R}_s$ on the vertex set of a hypergraph such that the Adjacency, Laplacian, and signless Laplacian operators associated with that hypergraph become $\mathfrak{R}_s$-compatible. The $\mathfrak{R}_s$-equivalence classes are named as units. Using units, we find some more symmetric substructures of hypergraphs called twin units, regular sets, co-regular sets, and symmetric sets. We collectively classify them as building blocks of hypergraphs. We show that the presence of these building blocks leaves certain traces in the spectrum and the corresponding eigenspaces of the $\mathfrak{R}_s$-compatible operators associated with the hypergraph. We also show that, conversely, some specific footprints in the spectrum and the corresponding eigenvectors retrace the presence of some of these building blocks in the hypergraph. Besides the spectra of $\mathfrak{R}_s$-compatible operators, building blocks are also interrelated with hypergraph colouring, distances in hypergraphs, hypergraph automorphisms, and random walks on hypergraphs.
title On some building blocks of hypergraphs
topic Combinatorics
Primary 05C65, 05C69, 05C15, 05C50, Secondary 05C12, 05C70, 05C81, 05C30, 05C07
url https://arxiv.org/abs/2206.09764