A subset S of a vertex set V is called a dominating set of graph G if every vertex of V -S is dominated by some element of set S. If e is an edge with end vertices u and v and degree of u is greater than or equal to degree of v then we say u strongly dominates v. If every vertex of V - S is strongly dominated by some vertex of S then S is called strong dominating set. The minimum cardinality of a strong dominating set is called the strong domination number of graph. We investigate strong domination numbers of some graphs and study related parameters
Vaidya, S. K. and Karkar, S. H.
On Strong Domination Number of Graphs,
Applications and Applied Mathematics: An International Journal (AAM), Vol. 12,
1, Article 39.
Available at: https://digitalcommons.pvamu.edu/aam/vol12/iss1/39