The spectral property of hypergraph coverings
arXiv:2108.13417 · doi:10.1016/j.disc.2023.113830
Abstract
Let be a connected -uniform hypergraph, and let be the adjacency tensor of whose spectrum is simply called the spectrum of . Let denote the number of eigenvectors of associated with the spectral radius, and denote the number of eigenvalues of with modulus equal to the spectral radius, which are respectively called the stabilizing index and cyclic index of . Let be a -fold covering of which can be obtained from some permutation assignment in the symmetric group on . In this paper, we first characterize the connectedness of by its incidence graph and the permutation assignment, and then investigate the relationship between the spectral property of and that of . By applying module theory and group representation, if is connected, we prove that and . In particular, when is a -fold covering of , if is even, we show that regardless of multiplicities, the spectrum of contains the spectrum of and the spectrum of a signed hypergraph with as underlying hypergraph; if is odd, we give an explicit formula for . We also find some differences on the spectral property between hypergraph coverings and graph coverings by examples.
References in corpus (4)
- The spectral symmetry of weakly irreducible nonnegative tensors and connected hypergraphs
- Eigenvariety of Nonnegative Symmetric Weakly Irreducible Tensors Associated with Spectral Radius and Its Application to Hypergraphs
- The largest -eigenvalue and spectral radius of Laplacian tensor of non-odd-bipartite generalized power hypergraphs
- The cyclic index of adjacency tensor of generalized power hypergraphs