On the spectral radius of a class of non-odd-bipartite even uniform hypergraphs

In order to investigate the non-odd-bipartiteness of even uniform hypergraphs, starting from a simple graph G, we construct a generalized power of G  , denoted by Gk,sGk,s, which is obtained from G by blowing up each vertex into a s  -set and each edge into a (k−2s)(k−2s)-set, where s≤k/2s≤k/2. When s