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

On the Strong Secure Domination Number of a Graph

Author

Listed:
  • Turki Alsuraiheed

    (Department of Mathematics, College of Science, King Saud University, Riyadh 11451, Saudi Arabia)

  • J. Annaal Mercy

    (Department of Mathematics, St. Joseph’s College, Affiliated to Bharathidasan University, Trichy 620002, India)

  • L. Benedict Michael Raj

    (Department of Mathematics, St. Joseph’s College, Affiliated to Bharathidasan University, Trichy 620002, India)

  • Thangaraj Asir

    (Department of Mathematics, Pondicherry University, Puducherry 605014, India)

Abstract

In this paper, we characterize trees with a strong secure domination number less than or equal to 4 and compute this parameter for certain classes of graphs. Also, we investigate bounds for the strong secure domination number of vertex gluing of two graphs.

Suggested Citation

  • Turki Alsuraiheed & J. Annaal Mercy & L. Benedict Michael Raj & Thangaraj Asir, 2024. "On the Strong Secure Domination Number of a Graph," Mathematics, MDPI, vol. 12(11), pages 1-10, May.
    • Handle: RePEc:gam:jmathe:v:12:y:2024:i:11:p:1666-:d:1402705
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/12/11/1666/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/12/11/1666/
    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:12:y:2024:i:11:p:1666-:d:1402705. 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.