Let G = (V, E) be the given graph, a subset D ⊆ V is defined as the dominating set if every vertices in the set (V-D) is adjacent to at least one vertex in the set D. Then the set D is known as the Dominating set. Let xy ∈ E be an edge in Graph G then x strongly dominates y if deg x ≥ deg y. Set D is known as a strong dominating set of G if every vertex of (V-D) is strongly dominated by some element in set D. Strong domination number is the minimum cardinality of strong dominating set it is represented by γst(G). In this paper we investigated the strong domination number of crown graph, sunflower graph, vertex switching of gear graph, vertex switching of wheel graph. Applications of strong domination numbers extend to security frameworks and alert-based systems, emphasizing their importance in net- work reliability and control.