- Celal Bayar Üniversitesi Fen Bilimleri Dergisi
- Vol: 11 Issue: 2
- Strong Domination Number of Some Graphs
Strong Domination Number of Some Graphs
Authors : Derya Doğan Durgun, Berna Lökçü
Pages : 0-0
Doi:10.18466/cbujos.21781
View : 20 | Download : 4
Publication Date : 2015-12-23
Article Type : Other
Abstract :In this paper, we consider strong domination number of P n k and C n k . Let G=(V,E) be a graph, V is a vertex set and E is an edge set of graph G and u,v ∈V . u strongly dominates v and v weakly dominates u if (i) uv ∈ E and (ii) d ( u, G ) ≥ d ( v, G ) . A set D ⊂V is a strong-dominating set ( sd -set) of G if every vertex in V-D is strongly dominated by at least one vertex in D . The strong domination number γ s of G is the minimum cardinality of an sd -set.Keywords : Domination Number, Strong Domination Number, Power of a Graph, Networks, sd-set