All eigenvalues of the power hypergraph and signed subgraphs of a graph
A hypergraph \(H\) is called \(k\)-uniform if each edge of \(H\) contains exactly \(k\) vertices. The eigenvalues of \(H\) are the eigenvalues of its adjacency tensor. The \(k\)-power hypergraph \(G^{(k)}\) is the \(k\)-uniform hypergraph that is obtained by adding \(k-2\) new vertices to each edge of a graph \(G\), for \(k\geq 3\). In [\textit{K. Cardoso} et al., ibid. 590, 243--257 (2020; Zbl 1437.05169)] it was stated that all distinct eigenvalues of the generalized hypergraph \(H_s^{(k)}\) can be generated from eigenvalues of subgraphs of the \(r\)-uniform hypergraph \(H\). When this result is restricted to the case that \(H\) is a graph \(G\) (\(r=2\)), then the obtained statement is incorrect. In this paper, the result of \textit{J. Zhou} et al. [Electron. J. Comb. 21, No. 4, Research Paper P4.24, 14 p. (2014; Zbl 1302.05114)] is extended and the incorrect statement is corrected by using the spectra of signed subgraphs of \(G\). The main theorem reads as follows. Theorem. The complex number \(\lambda\) is an eigenvalue of \(G^{(k)}\) if and only if \begin{itemize} \item some signed induced subgraph of \(G\) has an eigenvalue \(\beta\) such that \(\beta^2=\lambda^k\), when \(k=3\); \item some signed subgraph of \(G\) has an eigenvalue \(\beta\) such that \(\beta^2=\lambda^k\), when \(k\geq 4\). \end{itemize} This shows that all eigenvalues of a power hypergraph \(G^{(k)}\) can be generated from the eigenvalues of signed subgraphs of the underlying graph \(G\).
- 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
- Relating hypergraph parameters of generalized power graphs
- The spectrum of a class of uniform hypergraphs
- The \(H\)-spectra of a class of generalized power hypergraphs
- The characteristic polynomials of uniform double hyperstars and uniform hypertriangles
- Spectra of power hypergraphs and signed graphs via parity-closed walks
- On the second-largest modulus among the eigenvalues of a power hypergraph
- High-ordered spectral characterization of unicyclic graphs
- The characteristic polynomials of uniform hypercycles with length four
- High-order spectral characterizations of 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)
