A 2-stable set (or a distance-two independent set) of a graph $G$ is a set of vertices which are pairwise at a distance greater than 2 in $G$.
Is there a name for a set of vertices which are pairwise at a distance at most 2?
Such a set for a graph $G$ is basically a clique in the square graph $G^2$ of G. Are there any papers that study (or at least mention) this parameter?
Update (2022-03-09):
A set of vertices $S$ in a graph $G$ such that $d_G(u,v)\leq 2$ for all $u,v\in S$ is called a '2-clique' in $G$ (2nd definition here: [1]; usual meaning of $k$-clique is a clique of size $k$). Another related concept is that of a 2-club (also called 2-clan). A 2-club in $G$ is a set of vertices $S$ in $G$ such that $d_{G[S]}(u,v)\leq 2$ for all $u,v\in S$ [2]. I am interested in '2-cliques', not 2-clubs. A clique in $G^2$ is a '2-clique', not a 2-club. Thanks to JimN for directing me to the youtube channel Wrath of Math and thus to [1].
[1] https://www.youtube.com/watch?v=LqPHg9uNp-o
[2] https://www.youtube.com/watch?v=hw3VJCTgnIA