More on the Enumeration of Some Kind of Dominating Sets in Cactus Chains
Author(s):
Article Type:
Research/Original Article (دارای رتبه معتبر)
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:
Language:
English
Published:
Mathematics Interdisciplinary Research, Volume:7 Issue: 3, Summer 2022
Pages:
217 to 237
https://www.magiran.com/p2548296
سامانه نویسندگان
مقالات دیگری از این نویسنده (گان)
-
Identification of communities in social networks based on game theory with stable coalitions
Mohammad Vali Hairan, Ali Delavar Khalafi *, , Zahra Nikooeinejad, Mahdiyeh Hasheminezhad
Journal of Mathematics and Society, Summer 2025 -
Bell's Degree Variance and Degree Deviation in Graphs: Analyzing Optimal Graphs Based on These Irregularity Measures
Mohsen Sayadi, Hasan Barzegar *, , Nima Ghanbari
Control and Optimization in Applied Mathematics, Winter-Spring 2025