Title of article
More on the Enumeration of Some Kind of Dominating Sets in Cactus Chains
Author/Authors
Jahari ، Somayeh Department of Mathematical Sciences - Yazd University , Alikhani ، Saeid Department of Mathematical Sciences - Yazd University
From page
217
To page
237
Abstract
A non-empty set S ⊆ V is a dominating set, if every vertex not in S is adjacent to at least one vertex in S, and S is a total dominating set, if every vertex of V is adjacent to some vertices of S. We enumerate dominating sets, non-split dominating sets and total dominating sets in several classes of cactus chains.
Keywords
Dominating sets , Total dominating sets , Generating function , Cactus graphs , i , uniform
Journal title
Mathematics Interdisciplinary Research
Journal title
Mathematics Interdisciplinary Research
Record number
2737438
Link To Document