Computing m-Eternal Domination Number of Cactus Graphs in Linear Time

Computing m-Eternal Domination Number of Cactus Graphs in Linear Time

In m-eternal domination attacker and defender play on a graph. Initially, the defender places guards on vertices. In each round, the attacker chooses a vertex to attack. Then, the defender can move each guard to a neighboring vertex and must move a guard to the attacked vertex. The m-eternal dominat...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Blažej, Václav, Křišťan, Jan Matyáš, Valla, Tomáš
Format: Artikel
Sprache:eng
Schlagworte:
Computer Science - Data Structures and Algorithms
Computer Science - Discrete Mathematics
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator Blažej, Václav
Křišťan, Jan Matyáš
Valla, Tomáš
description In m-eternal domination attacker and defender play on a graph. Initially, the defender places guards on vertices. In each round, the attacker chooses a vertex to attack. Then, the defender can move each guard to a neighboring vertex and must move a guard to the attacked vertex. The m-eternal domination number is the minimum number of guards such that the graph can be defended indefinitely. In this paper, we study the m-eternal domination number of cactus graphs. We consider two variants of the m-eternal domination number: one allows multiple guards to occupy a single vertex, the second variant requires the guards to occupy distinct vertices. We develop several tools for obtaining lower and upper bounds on these problems and we use them to obtain an algorithm which computes the minimum number of required guards of cactus graphs for both variants of the problem.
doi_str_mv 10.48550/arxiv.2301.05155
format Article
fullrecord <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2301_05155</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2301_05155</sourcerecordid><originalsourceid>FETCH-LOGICAL-a675-192c5f79435c23c56cdfa6ab59f51a165800773c7d3aaefc7abf98d59a8f06bd3</originalsourceid><addsrcrecordid>eNotz7FOwzAUQFEvDKjwAUz1DyTYcZ8djyikBSlql-zRi2O3lmonchJU_h5RmO52pUPIC2f5rgRgr5hu_isvBOM5Aw7wSOpqDNO6-HimIasXmyJe6fsYfMTFj5Ee19DbREdHKzTLOtNDwukyUx9p46PFRFsf7BN5cHid7fN_N6Td1231kTWnw2f11mQoFWRcFwac0jsBphAGpBkcSuxBO-DIJZSMKSWMGgSidUZh73Q5gMbSMdkPYkO2f9u7o5uSD5i-u19Pd_eIH095RW0</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Computing m-Eternal Domination Number of Cactus Graphs in Linear Time</title><source>arXiv.org</source><creator>Blažej, Václav ; Křišťan, Jan Matyáš ; Valla, Tomáš</creator><creatorcontrib>Blažej, Václav ; Křišťan, Jan Matyáš ; Valla, Tomáš</creatorcontrib><description>In m-eternal domination attacker and defender play on a graph. Initially, the defender places guards on vertices. In each round, the attacker chooses a vertex to attack. Then, the defender can move each guard to a neighboring vertex and must move a guard to the attacked vertex. The m-eternal domination number is the minimum number of guards such that the graph can be defended indefinitely. In this paper, we study the m-eternal domination number of cactus graphs. We consider two variants of the m-eternal domination number: one allows multiple guards to occupy a single vertex, the second variant requires the guards to occupy distinct vertices. We develop several tools for obtaining lower and upper bounds on these problems and we use them to obtain an algorithm which computes the minimum number of required guards of cactus graphs for both variants of the problem.</description><identifier>DOI: 10.48550/arxiv.2301.05155</identifier><language>eng</language><subject>Computer Science - Data Structures and Algorithms ; Computer Science - Discrete Mathematics</subject><creationdate>2023-01</creationdate><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,781,886</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/2301.05155$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2301.05155$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Blažej, Václav</creatorcontrib><creatorcontrib>Křišťan, Jan Matyáš</creatorcontrib><creatorcontrib>Valla, Tomáš</creatorcontrib><title>Computing m-Eternal Domination Number of Cactus Graphs in Linear Time</title><description>In m-eternal domination attacker and defender play on a graph. Initially, the defender places guards on vertices. In each round, the attacker chooses a vertex to attack. Then, the defender can move each guard to a neighboring vertex and must move a guard to the attacked vertex. The m-eternal domination number is the minimum number of guards such that the graph can be defended indefinitely. In this paper, we study the m-eternal domination number of cactus graphs. We consider two variants of the m-eternal domination number: one allows multiple guards to occupy a single vertex, the second variant requires the guards to occupy distinct vertices. We develop several tools for obtaining lower and upper bounds on these problems and we use them to obtain an algorithm which computes the minimum number of required guards of cactus graphs for both variants of the problem.</description><subject>Computer Science - Data Structures and Algorithms</subject><subject>Computer Science - Discrete Mathematics</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotz7FOwzAUQFEvDKjwAUz1DyTYcZ8djyikBSlql-zRi2O3lmonchJU_h5RmO52pUPIC2f5rgRgr5hu_isvBOM5Aw7wSOpqDNO6-HimIasXmyJe6fsYfMTFj5Ee19DbREdHKzTLOtNDwukyUx9p46PFRFsf7BN5cHid7fN_N6Td1231kTWnw2f11mQoFWRcFwac0jsBphAGpBkcSuxBO-DIJZSMKSWMGgSidUZh73Q5gMbSMdkPYkO2f9u7o5uSD5i-u19Pd_eIH095RW0</recordid><startdate>20230112</startdate><enddate>20230112</enddate><creator>Blažej, Václav</creator><creator>Křišťan, Jan Matyáš</creator><creator>Valla, Tomáš</creator><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>20230112</creationdate><title>Computing m-Eternal Domination Number of Cactus Graphs in Linear Time</title><author>Blažej, Václav ; Křišťan, Jan Matyáš ; Valla, Tomáš</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a675-192c5f79435c23c56cdfa6ab59f51a165800773c7d3aaefc7abf98d59a8f06bd3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2023</creationdate><topic>Computer Science - Data Structures and Algorithms</topic><topic>Computer Science - Discrete Mathematics</topic><toplevel>online_resources</toplevel><creatorcontrib>Blažej, Václav</creatorcontrib><creatorcontrib>Křišťan, Jan Matyáš</creatorcontrib><creatorcontrib>Valla, Tomáš</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Blažej, Václav</au><au>Křišťan, Jan Matyáš</au><au>Valla, Tomáš</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Computing m-Eternal Domination Number of Cactus Graphs in Linear Time</atitle><date>2023-01-12</date><risdate>2023</risdate><abstract>In m-eternal domination attacker and defender play on a graph. Initially, the defender places guards on vertices. In each round, the attacker chooses a vertex to attack. Then, the defender can move each guard to a neighboring vertex and must move a guard to the attacked vertex. The m-eternal domination number is the minimum number of guards such that the graph can be defended indefinitely. In this paper, we study the m-eternal domination number of cactus graphs. We consider two variants of the m-eternal domination number: one allows multiple guards to occupy a single vertex, the second variant requires the guards to occupy distinct vertices. We develop several tools for obtaining lower and upper bounds on these problems and we use them to obtain an algorithm which computes the minimum number of required guards of cactus graphs for both variants of the problem.</abstract><doi>10.48550/arxiv.2301.05155</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier DOI: 10.48550/arxiv.2301.05155
ispartof
issn
language eng
recordid cdi_arxiv_primary_2301_05155
source arXiv.org
subjects Computer Science - Data Structures and Algorithms
Computer Science - Discrete Mathematics
title Computing m-Eternal Domination Number of Cactus Graphs in Linear Time
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-13T16%3A00%3A45IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Computing%20m-Eternal%20Domination%20Number%20of%20Cactus%20Graphs%20in%20Linear%20Time&rft.au=Bla%C5%BEej,%20V%C3%A1clav&rft.date=2023-01-12&rft_id=info:doi/10.48550/arxiv.2301.05155&rft_dat=%3Carxiv_GOX%3E2301_05155%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true