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

Message:
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.
Language:
English
Published:
Mathematics Interdisciplinary Research, Volume:7 Issue: 3, Summer 2022
Pages:
217 to 237
https://www.magiran.com/p2548296  
سامانه نویسندگان
  • Corresponding Author (2)
    Saeid Alikhani
    Professor Department of Mathematics, Yazd University, University of Yazd, Yazd, Iran
    Alikhani، Saeid
اطلاعات نویسنده(گان) توسط ایشان ثبت و تکمیل شده‌است. برای مشاهده مشخصات و فهرست همه مطالب، صفحه رزومه را ببینید.
مقالات دیگری از این نویسنده (گان)