The vertex visibility number of graphs
If $x\in V(G)$, then $S\subseteq V(G)\setminus\{x\}$ is an $x$-visibility set if for any $y\in S$ there exists a shortest $x,y$-path avoiding $S$. The $x$-visibility number $v_x(G)$ is the maximum cardinality of an $x$-visibility set, and the maximum value of $v_x(G)$ among all vertices $x$ of $G$ is the vertex visibility number ${\rm vv}(G)$ of $G$. It is proved that ${\rm vv}(G)$ is equal to the largest possible number of leaves of a shortest-path tree of $G$. Deciding whether $v_x(G) \ge k$ holds for given $G$, a vertex $x\in V(G)$, and a positive integer $k$ is NP-complete even for graphs of diameter $2$. Several general sharp lower and upper bounds on the vertex visibility number are proved. The vertex visibility number of Cartesian products is also bounded from below and above, and the exact value of the vertex visibility number is determined for square grids, square prisms, and square toruses.