Key points are not available for this paper at this time.
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.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: