IDEAS home Printed from https://ideas.repec.org/a/hin/jnljam/6627272.html
   My bibliography  Save this article

Eternal Domination of Generalized Petersen Graph

Author

Listed:
  • Ramy Shaheen
  • Ali Kassem

Abstract

An eternal dominating set of a graph is a set of guards distributed on the vertices of a dominating set so that each vertex can be occupied by one guard only. These guards can defend any infinite series of attacks; an attack is defended by moving one guard along an edge from its position to the attacked vertex. We consider the “all guards move†of the eternal dominating set problem, in which one guard has to move to the attacked vertex and all the remaining guards are allowed to move to an adjacent vertex or stay in their current positions after each attack in order to form a dominating set on the graph and at each step can be moved after each attack. The “all guards move model†is called the - eternal domination model. The size of the smallest - eternal dominating set is called the - eternal domination number and is denoted by . In this paper, we find and for . We also find upper bounds for and when is arbitrary.

Suggested Citation

  • Ramy Shaheen & Ali Kassem, 2021. "Eternal Domination of Generalized Petersen Graph," Journal of Applied Mathematics, Hindawi, vol. 2021, pages 1-10, January.
    • Handle: RePEc:hin:jnljam:6627272
    DOI: 10.1155/2021/6627272
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/JAM/2021/6627272.pdf
    Download Restriction: no
    File URL: http://downloads.hindawi.com/journals/JAM/2021/6627272.xml
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2021/6627272?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
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:hin:jnljam:6627272. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.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.