In this presentation, we firstly introduce the largest and the second largest eigenvalues of a k-uniform hypergraph with respect to an order partition of [k]. Secondly, we present a generalization of the graph Expander Mixing Lemma which relates spectral and expansion properties of graphs.