2024
DOI: 10.3390/math12111666
|View full text |Cite
|
Sign up to set email alerts
|

On the Strong Secure Domination Number of a Graph

Turki Alsuraiheed,
J. Annaal Mercy,
L. Benedict Michael Raj
et al.

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.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Publication Types

Select...

Relationship

0
0

Authors

Journals

citations
Cited by 0 publications
references
References 12 publications
0
0
0
Order By: Relevance

No citations

Set email alert for when this publication receives citations?