%0 Journal Article
%T More on the Enumeration of Some Kind of Dominating Sets in Cactus Chains
%J Mathematics Interdisciplinary Research
%I University of Kashan
%Z 2538-3639
%A Jahari, Somayeh
%A Alikhani, Saeid
%D 2022
%\ 09/01/2022
%V 7
%N 3
%P 217-237
%! More on the Enumeration of Some Kind of Dominating Sets in Cactus Chains
%K Dominating sets
%K Total dominating sets
%K Generating function
%K Cactus graphs
%K i-uniform
%R 10.22052/mir.2022.246437.1352
%X 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.
%U https://mir.kashanu.ac.ir/article_112056_f64e49cef8eb9b3623b329f018b7f209.pdf