Title of article
ON THE STRONG DOMINATING SETS OF GRAPHS
Author/Authors
Zaherifar ، Hassan Department of Mathematical Sciences - Yazd University , Alikhani ، Saeid Department of Mathematical Sciences - Yazd University , Ghanbari ، Nima Department of Informatics - University of Bergen
From page
65
To page
76
Abstract
Let G = (V (G);E(G)) be a simple graph. A set D V (G) is a strong dominating set of G, if for every vertex x 2 V (G) n D there is a vertex y 2 D with xy 2 E(G) and deg(x) deg(y). The strong domination number st(G) is defined as the minimum cardinality of a strong dominating set. In this paper, we calculate st(G) for specific graphs and study the number of strong dominating sets of some graphs.
Keywords
Dominating set , strong domination number , product
Journal title
Journal of Algebraic Systems
Journal title
Journal of Algebraic Systems
Record number
2735381
Link To Document