IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v41y2021i2d10.1007_s10878-020-00679-w.html
   My bibliography  Save this article

Secure domination in rooted product graphs

Author

Listed:
  • Rangel Hernández-Ortiz

    (Universidad Autónoma Metropolitana)

  • Luis Pedro Montejano

    (Universitat Rovira i Virgili)

  • Juan Alberto Rodríguez-Velázquez

    (Universitat Rovira i Virgili)

Abstract

A secure dominating set of a graph G is a dominating set S satisfying that for every vertex $$v\in V(G){\setminus } S$$ v ∈ V ( G ) \ S there exists a neighbour $$u\in S$$ u ∈ S of v such that $$(S\cup \{v\}){\setminus } \{u\}$$ ( S ∪ { v } ) \ { u } is a dominating set as well. The secure domination number, denoted by $$\gamma _s(G)$$ γ s ( G ) , is the minimum cardinality among all secure dominating sets of G. This concept was introduced in 2005 by Cockayne et al. and studied further in a number of works. The problem of computing the secure domination number is NP-Hard. This suggests finding the secure domination number for special classes of graphs or obtaining tight bounds on this invariant. The aim of this work is to obtain closed formulas for the secure domination number of rooted product graphs. We show that for any graph G of order n(G) and any graph H with root v, the secure domination number of the rooted product graph $$G\circ _vH$$ G ∘ v H satisfies one of the following three formulas, $$\gamma _{s}(G\circ _vH)=n(G)(\gamma _{s}(H)-1)+\gamma (G)$$ γ s ( G ∘ v H ) = n ( G ) ( γ s ( H ) - 1 ) + γ ( G ) , $$\gamma _{s}(G\circ _vH)= n(G)(\gamma _{s}(H)-1)+\gamma _{s}(G)$$ γ s ( G ∘ v H ) = n ( G ) ( γ s ( H ) - 1 ) + γ s ( G ) or $$\gamma _{s}(G\circ _vH)= n(G)\gamma _{s}(H)$$ γ s ( G ∘ v H ) = n ( G ) γ s ( H ) , where $$\gamma (G)$$ γ ( G ) denotes the domination number of G. We also characterize the graphs that satisfy each of these expressions. As a particular case of the study, we derive the corresponding results for corona graphs.

Suggested Citation

  • Rangel Hernández-Ortiz & Luis Pedro Montejano & Juan Alberto Rodríguez-Velázquez, 2021. "Secure domination in rooted product graphs," Journal of Combinatorial Optimization, Springer, vol. 41(2), pages 401-413, February.
  • Handle: RePEc:spr:jcomop:v:41:y:2021:i:2:d:10.1007_s10878-020-00679-w
    DOI: 10.1007/s10878-020-00679-w
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-020-00679-w
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10878-020-00679-w?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:spr:jcomop:v:41:y:2021:i:2:d:10.1007_s10878-020-00679-w. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.