Physical Sciences and Mathematics Commons^™

On Strong Domination Number Of Graphs, S. K. Vaidya, S. H. Karkar

Applications and Applied Mathematics: An International Journal (AAM)

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 …