Optimal 1-planar graphs which triangulate other surfaces

We show that, for any given non-spherical orientable closed surface F2F2, there exists an optimal 1-planar graph which can be embedded on F2F2 as a triangulation. On the other hand, we prove that there does not exist any such graph for the nonorientable closed surfaces of genus at most 3.