2 problems

Let $G$ be a graph of order $n$, and let $\delta(G)$ denote its minimum degree. In the Minimizer-start competition-enclaveless game, Minimizer starts, and $\Psi_g^-(G)$ is the numb…

Let $G$ be a graph of order $n$ with no isolated vertices. In the competition-enclaveless game, Maximizer starts, and $\Psi_g^+(G)$ is the number of vertices chosen when both playe…