Durgun D.D.Lökçü B.2025-04-102025-04-102020http://hdl.handle.net/20.500.14701/46760Let G = (V,E) be a graph and u,v V. A dominating set D is a set of vertices such that each vertex of G is either in D or has at least one neighbor in D. The minimum cardinality of such a set is called the domination number of G, γ(G). u strongly dominates v and v weakly dominates u if (i) uv E and (ii) deg u ≥deg v. A set D V is a strong-dominating set, shortly sd-set, (weak-dominating set, shortly wd-set) of G if every vertex in V-D is strongly (weakly) dominated by at least one vertex in D. The strong (weak) domination number γs(γw) of G is the minimum cardinality of an sd-set (wd-set). In this paper, we present weak and strong domination numbers of thorn graphs. © 2020 World Scientific Publishing Company.Article10.1142/S1793557120500710