More on the Enumeration of Some Kind of Dominating Sets in Cactus Chains

نویسندگان
Alikhani, Saeid ID 1
Jahari, Somayeh ID 2

1 Department of Mathematical Sciences, Yazd University, Yazd, Iran

2 Department of Mathematical Sciences, Yazd University, Yazd, Iran

doi
10.22052/mir.2022.246437.1352
چکیده

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.

کلیدواژه‌ها
Dominating sets, Total dominating sets, Generating function, Cactus graphs, i-uniform