Cored Hypergraphs, Power Hypergraphs and Their Laplacian H-Eigenvalues
Preprint
Abstract
In this paper, we introduce the class of cored hypergraphs and power hypergraphs, and investigate the properties of their Laplacian H-eigenvalues. From an ordinary graph, one may generate a $k$-uniform hypergraph, called the $k$th power hypergraph of that graph. Power hypergraphs are cored hypergraphs, but not vice versa. Hyperstars, hypercycles, hyperpaths are special cases of power hypergraphs, while sunflowers are a subclass of cored hypergraphs, but not power graphs in general. We show that the largest Laplacian H-eigenvalue of an even-uniform cored hypergraph is equal to its largest signless Laplacian H-eigenvalue. Especially, we find out these largest H-eigenvalues for even-uniform sunflowers. Moreover, we show that the largest Laplacian H-eigenvalue of an odd-uniform sunflower, hypercycle and hyperpath is equal to the maximum degree, i.e., 2. We also compute out the H-spectra of the class of hyperstars. When $k$ is odd, the H-spectra of the hypercycle of size 3 and the hyperpath of length 3 are characterized as well.
Keywords
All Related Versions
This publication has 13 references indexed in Scilit:
- The largest Laplacian and signless Laplacian H-eigenvalues of a uniform hypergraphLinear Algebra and its Applications, 2015
- Symmetric nonnegative tensors and copositive tensorsLinear Algebra and its Applications, 2013
- TheZ‐eigenvalues of a symmetric tensor and its application to spectral hypergraph theoryNumerical Linear Algebra with Applications, 2013
- On determinants and eigenvalue theory of tensorsJournal of Symbolic Computation, 2013
- The Laplacian of a uniform hypergraphJournal of Combinatorial Optimization, 2013
- H-Eigenvalues of signless Laplacian tensor for an even uniform hypergraphFrontiers of Mathematics in China, 2013
- Spectra of uniform hypergraphsLinear Algebra and its Applications, 2012
- Algebraic connectivity of an even uniform hypergraphJournal of Combinatorial Optimization, 2011
- A generalization of the Motzkin–Straus theorem to hypergraphsOptimization Letters, 2008
- Eigenvalues of a real supersymmetric tensorJournal of Symbolic Computation, 2005