The generalized power of a simple graph G, denoted by Gk,s, is obtained from G by blowing up each vertex into an 70a5a17714e9a28b478" title="Click to view the MathML source">s-set and each edge into a k-set, where . When 70c61f1506">, Gk,s is always odd-bipartite. It is known that 70fd0"> is non-odd-bipartite if and only if G is non-bipartite, and 70fd0"> has the same adjacency (respectively, signless Laplacian) spectral radius as G. In this paper, we prove that, regardless of multiplicities, the H-spectrum of (respectively, ) consists of all eigenvalues of the adjacency matrices (respectively, the signless Laplacian matrices) of the connected induced subgraphs (respectively, modified induced subgraphs) of G. As a corollary, 70fd0"> has the same least adjacency (respectively, least signless Laplacian) H-eigenvalue as G. We also discuss the limit points of the least adjacency H-eigenvalues of hypergraphs, and construct a sequence of non-odd-bipartite hypergraphs whose least adjacency H-eigenvalues converge to 42199cbb34f38e228591373d5adebb">.