Los puntos clave no están disponibles para este artículo en este momento.
In this paper, we characterize trees with a strong secure domination number less than or equal to 4 and compute this parameter for certain classes of graphs. Also, we investigate bounds for the strong secure domination number of vertex gluing of two graphs.
Alsuraiheed et al. (Mon,) studied this question.