The general position number and the iteration time in the P3 convexity

In this paper, we investigate two graph convexity parameters: the iteration time and the general position number. Harary and Nieminem introduced in 1981 the iteration time in the geodesic convexity, but its computational complexity was still open. Manuel and Klav\v{z}ar introduced in 2018 the general position number of the geodesic convexity and proved that it is NP-hard to compute. In this paper, we extend these parameters to the P3 convexity and prove that it is NP-hard to compute them. With this, we also prove that the iteration number is NP-hard on the geodesic convexity even in graphs with diameter two. These results are the last three missing NP-hardness results regarding the ten most studied graph convexity parameters in the geodesic and P3 convexities