On the Computational Complexity of the Strong Geodetic Recognition Problem

Carlos V. G. C. Lima, Vinicius F. dos Santos, João H. G. Sousa +1

A strong geodetic set of a graph~$G=(V,E)$ is a vertex set~$S\subseteq V(G)$ in which it is possible to cover all the remaining vertices of~$V(G)\setminus S$ by assigning a uniqu…