On the Strong Secure Domination Number of a Graph

Turki Alsuraiheed, J. Annaal Mercy, L. Benedict Michael Raj and Thangaraj Asir ()
Additional contact information
Turki Alsuraiheed: Department of Mathematics, College of Science, King Saud University, Riyadh 11451, Saudi Arabia
J. Annaal Mercy: Department of Mathematics, St. Joseph’s College, Affiliated to Bharathidasan University, Trichy 620002, India
L. Benedict Michael Raj: Department of Mathematics, St. Joseph’s College, Affiliated to Bharathidasan University, Trichy 620002, India
Thangaraj Asir: Department of Mathematics, Pondicherry University, Puducherry 605014, India

Mathematics, 2024, vol. 12, issue 11, 1-10

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.

Keywords: secure domination; strong secure domination; tree; vertex gluing (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2024
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/12/11/1666/pdf (application/pdf)
https://www.mdpi.com/2227-7390/12/11/1666/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:12:y:2024:i:11:p:1666-:d:1402705

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().