University of KashanMathematics Interdisciplinary Research2538-36397320220901More on the Enumeration of Some Kind of Dominating Sets in Cactus Chains21723711205610.22052/mir.2022.246437.1352ENSomayehJahariDepartment of Mathematical Sciences,
Yazd University,
Yazd, IranSaeidAlikhaniDepartment of Mathematical Sciences,
Yazd University,
Yazd, IranJournal Article20220529A non-empty set <em>S</em> ⊆ <em>V</em> is a dominating set, if every vertex not in <em>S</em> is adjacent to at least one vertex in <em>S</em>, and <em>S</em> is a total dominating set, if every vertex of <em>V</em> is adjacent to some vertices of <em>S</em>. We enumerate dominating sets, non-split dominating sets and total dominating sets in several classes of cactus chains.https://mir.kashanu.ac.ir/article_112056_f64e49cef8eb9b3623b329f018b7f209.pdf