Derya DOĞAN DURGUNBerna LÖKÇÜ2024-07-242024-07-2420151305-130Xhttp://akademikarsiv.cbu.edu.tr:4000/handle/123456789/24532In this paper, we consider strong domination number of Pnk and Cnk . 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 VD is strongly dominated by at least one vertex in D. The strong domination number ?s of G is the minimum cardinality of an sd-setengAraştırma Makalesi