IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v7y2019i9p820-d264553.html
   My bibliography  Save this article

Independent Domination Stable Trees and Unicyclic Graphs

Author

Listed:
  • Pu Wu

    (Institute of Computing Science and Technology, Guangzhou University, Guangzhou 510006, China)

  • Huiqin Jiang

    (Institute of Computing Science and Technology, Guangzhou University, Guangzhou 510006, China)

  • Sakineh Nazari-Moghaddam

    (Department of Mathematics, Azarbaijan Shahid Madani University, Tabriz 5375171379, Iran)

  • Seyed Mahmoud Sheikholeslami

    (Department of Mathematics, Azarbaijan Shahid Madani University, Tabriz 5375171379, Iran)

  • Zehui Shao

    (Institute of Computing Science and Technology, Guangzhou University, Guangzhou 510006, China)

  • Lutz Volkmann

    (Lehrstuhl II für Mathematik, RWTH Aachen University, 52056 Aachen, Germany)

Abstract

A set S ⊆ V ( G ) in a graph G is a dominating set if S dominates all vertices in G , where we say a vertex dominates each vertex in its closed neighbourhood. A set is independent if it is pairwise non-adjacent. The minimum cardinality of an independent dominating set on a graph G is called the independent domination number i ( G ) . A graph G is ID-stable if the independent domination number of G is not changed when any vertex is removed. In this paper, we study basic properties of ID-stable graphs and we characterize all ID-stable trees and unicyclic graphs. In addition, we establish bounds on the order of ID-stable trees.

Suggested Citation

  • Pu Wu & Huiqin Jiang & Sakineh Nazari-Moghaddam & Seyed Mahmoud Sheikholeslami & Zehui Shao & Lutz Volkmann, 2019. "Independent Domination Stable Trees and Unicyclic Graphs," Mathematics, MDPI, vol. 7(9), pages 1-17, September.
    • Handle: RePEc:gam:jmathe:v:7:y:2019:i:9:p:820-:d:264553
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/7/9/820/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/7/9/820/
    Download Restriction: no
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:7:y:2019:i:9:p:820-:d:264553. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.