The largest -eigenvalue and spectral radius of Laplacian tensor of non-odd-bipartite generalized power hypergraphs
arXiv:1510.02178 · doi:10.1016/j.laa.2016.04.007
Abstract
Let be a simple graph or hypergraph, and let be the adjacency, Laplacian and signless Laplacian tensors of respectively. The largest -eigenvalues (resp., the spectral radii) of are denoted respectively by (resp., ). For a connected non-bipartite simple graph , . But this does not hold for non-odd-bipartite hypergraphs. We will investigate this problem by considering a class of generalized power hypergraphs , which are constructed from simple connected graphs by blowing up each vertex of into a -set and preserving the adjacency of vertices. Suppose that is non-bipartite, or equivalently is non-odd-bipartite. We get the following spectral properties: (1) if and only if is a multiple of ; in this case . (2) If , then for sufficiently large , . Motivated by the study of hypergraphs , for a connected non-odd-bipartite hypergraph , we give a characterization of and having the same spectra or the spectrum of being symmetric with respect to the origin, that is, and , or and are similar via a complex (necessarily non-real) diagonal matrix with modular- diagonal entries. So we give an answer to a question raised by Shao et al., that is, for a non-odd-bipartite hypergraph , that and have the same spectra can not imply they have the same -spectra.
References in corpus (1)
Cited by in corpus (5)
- The spectral symmetry of weakly irreducible nonnegative tensors and connected hypergraphs
- Eigenvectors of Laplacian or signless Laplacian of Hypergraphs Associated with Zero Eigenvalue
- The spectral property of hypergraph coverings
- The least H-eigenvalue of adjacency tensor of hypergraphs with cut vertices
- The least H-eigenvalue of signless Laplacian of non-odd-bipartite hypergraphs