Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have