All eigenvalues of the power hypergraph and signed subgraphs of a graph
From MaRDI portal
Abstract: We show how all eigenvalues of a power hypergraph can be generated from the eigenvalues of signed subgraphs of the underlying graph . This fixes an incorrect statement in the case of power hypergraphs from [Linear Algebra and its Applications, 590:243-257, 2020].
Recommendations
- The spectrum of a class of uniform hypergraphs
- Relating hypergraph parameters of generalized power graphs
- The largest H-eigenvalue and spectral radius of Laplacian tensor of non-odd-bipartite generalized power hypergraphs
- The \(H\)-spectra of a class of generalized power hypergraphs
- Spectral radii of two kinds of uniform hypergraphs
- The proof of a conjecture on largest Laplacian and signless Laplacian H-eigenvalues of uniform hypergraphs
- Simplifying the computation of the spectrum of the complete \(k\)-uniform hypergraph
- On spectral hypergraph theory of the adjacency tensor
- The Laplacian of a uniform hypergraph
- On the spectral radius of a class of non-odd-bipartite even uniform hypergraphs
Cites work
Cited in
(9)- The characteristic polynomials of uniform hypercycles with length four
- The \(H\)-spectra of a class of generalized power hypergraphs
- Spectra of power hypergraphs and signed graphs via parity-closed walks
- The characteristic polynomials of uniform double hyperstars and uniform hypertriangles
- High-order spectral characterizations of graphs
- On the second-largest modulus among the eigenvalues of a power hypergraph
- Relating hypergraph parameters of generalized power graphs
- The spectrum of a class of uniform hypergraphs
- High-ordered spectral characterization of unicyclic graphs
This page was built for publication: All eigenvalues of the power hypergraph and signed subgraphs of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6178777)