Aytaç, A.Turaci, T.2024-09-292024-09-2920151492-8760https://hdl.handle.net/20.500.14619/9791Let G = (V(G),E(G)) be a graph. If uv ? E(G), then u and v dominate each other. Further, u strongly dominates v and v weakly dominates u if deg(u) ? deg(v). A set S ? V(G) is a strong-dominating set (sd-set) of G if every vertex in V(G) - S is strongly dominated by at least one vertex in S. Similarly, if every vertex in V(G) - S is weakly dominated by at least one vertex in S, then S is a weak-dominating set (wd-set). The strong (weak) domination number ?s(?w) of G is the minimum cardinality of an sdset (wd-set). In this paper the strong and weak domination numbers of complementary prisms are determined and also an algorithm for computing for strong and weak domination number of any graph is given. Copyright © 2015 Watam Press.eninfo:eu-repo/semantics/closedAccessComplementary prismsConnectivityGraph algorithmsGraph vulnerabilityNetwork design and communicationStrong and weak domination numberArticle2-s2.0-84937469210962Q48522