On the Strong Secure Domination Number of a Graph
oleh: Turki Alsuraiheed, J. Annaal Mercy, L. Benedict Michael Raj, Thangaraj Asir
| Format: | Article |
|---|---|
| Diterbitkan: | MDPI AG 2024-05-01 |
Deskripsi
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.