On the Strong Secure Domination Number of a Graph

On the Strong Secure Domination Number of a Graph

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.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Mathematics (Basel) 2024-06, Vol.12 (11), p.1666
Hauptverfasser: Alsuraiheed, Turki, Mercy, J. Annaal, Raj, L. Benedict Michael, Asir, Thangaraj
Format: Artikel
Sprache:eng
Schlagworte:
Access control
Connectivity
Graph theory
Graphs
Mathematical research
Neighborhoods
secure domination
strong secure domination
tree
Trees
Trees (mathematics)
Trouble shooting
vertex gluing
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:2227-7390
2227-7390
DOI:10.3390/math12111666