Nonorientable genera of Petersen powers

In the paper, we prove that for every integer n . 1, there exists a Petersen power P n with nonorientable genus and Euler genus precisely n, which improves the upper bound of Mohar and Vodopivec.s result [J. Graph Theory, 67, 1.8 (2011)] that for every integer k (2 . k . n.1), a Petersen power P n exists with nonorientable genus and Euler genus precisely k.