TY - JOUR
ID - 112056
TI - More on the Enumeration of Some Kind of Dominating Sets in Cactus Chains
JO - Mathematics Interdisciplinary Research
JA - MIR
LA - en
SN - 2538-3639
AU - Jahari, Somayeh
AU - Alikhani, Saeid
AD - Department of Mathematical Sciences,
Yazd University,
Yazd, Iran
Y1 - 2022
PY - 2022
VL - 7
IS - 3
SP - 217
EP - 237
KW - Dominating sets
KW - Total dominating sets
KW - Generating function
KW - Cactus graphs
KW - i-uniform
DO - 10.22052/mir.2022.246437.1352
N2 - 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.
UR - https://mir.kashanu.ac.ir/article_112056.html
L1 - https://mir.kashanu.ac.ir/article_112056_f64e49cef8eb9b3623b329f018b7f209.pdf
ER -