Weak and strong domination in thorn graphs
| dc.contributor.author | Durgun, DD | |
| dc.contributor.author | Lökçü, B | |
| dc.date.accessioned | 2025-04-10T10:28:41Z | |
| dc.date.available | 2025-04-10T10:28:41Z | |
| dc.description.abstract | Let G = (V, E) be a graph and u, v is an element of 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, gamma(G). u strongly dominates v and v weakly dominates u if (i) uv is an element of E and (ii) deg u >= deg v. A set D subset of 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 gamma(s)(gamma(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. | |
| dc.identifier.e-issn | 1793-7183 | |
| dc.identifier.issn | 1793-5571 | |
| dc.identifier.uri | http://hdl.handle.net/20.500.14701/35503 | |
| dc.language.iso | English | |
| dc.title | Weak and strong domination in thorn graphs | |
| dc.type | Article |