Secure domination number of generalized thorn graphs
A secure dominating set S ⊆ V is a dominating set of G satisfying the condition that for each u ∈ V \ S, there exists a vertex v ∈ N(u) ∩ S such that (S \ {v}) S {u} is a dominating set of G. The minimum cardinality of a secure dominating set of G is called the secure domination number of G, γs(G)....
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
University of Mohaghegh Ardabili
2025-06-01
|
| Series: | Journal of Hyperstructures |
| Subjects: | |
| Online Access: | https://jhs.uma.ac.ir/article_3843_434c7307f916a24939bef07eb0fb7cf8.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|