On the Strong Roman Domination Number of Graphs

Based on the history that the Emperor Constantine decreed that any undefended place (with no legions) of the Roman Empire must be protected by a "stronger" neighbor place (having two legions), a graph theoretical model called Roman domination in graphs was described. A Roman dominating fun...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Alvarez-Ruiz, M. P, Yero, I. Gonzalez, Mediavilla-Gradolph, T, Sheikholeslami, S. M, Valenzuela, J. C
Format: Artikel
Sprache:eng
Schlagworte:
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 Alvarez-Ruiz, M. P
Yero, I. Gonzalez
Mediavilla-Gradolph, T
Sheikholeslami, S. M
Valenzuela, J. C
description Based on the history that the Emperor Constantine decreed that any undefended place (with no legions) of the Roman Empire must be protected by a "stronger" neighbor place (having two legions), a graph theoretical model called Roman domination in graphs was described. A Roman dominating function for a graph $G=(V,E)$, is a function $f:V\rightarrow \{0,1,2\}$ such that every vertex $v$ with $f(v)=0$ has at least a neighbor $w$ in $G$ for which $f(w)=2$. The Roman domination number of a graph is the minimum weight, $\sum_{v\in V}f(v)$, of a Roman dominating function. In this paper we initiate the study of a new parameter related to Roman domination, which we call strong Roman domination number and denote it by $\gamma_{StR}(G)$. We approach the problem of a Roman domination-type defensive strategy under multiple simultaneous attacks and begin with the study of several mathematical properties of this invariant. In particular, we first show that the decision problem regarding the computation of the strong Roman domination number is NP-complete, even when restricted to bipartite graphs. We obtain several bounds on such a parameter and give some realizability results for it. Moreover, we prove that for any tree $T$ of order $n\ge 3$, $\gamma_{StR}(T)\le 6n/7$ and characterize all extremal trees.
doi_str_mv 10.48550/arxiv.1502.03933
format Article
fullrecord <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_1502_03933</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1502_03933</sourcerecordid><originalsourceid>FETCH-LOGICAL-a673-5da5e5753ce9216712bccaa01646070d0d7c896d1bfd071a8a8457d81465045b3</originalsourceid><addsrcrecordid>eNotzrFuwjAUQFEvHSraD-hU_0DCc-xnOyMKlFZCIAF79BI7JRKxI5NW7d9XBaa7XR3GXgTkyiLCnNJP_50LhCIHWUr5yOa7wKeT54cpxfDJ93GgwJdx6ANNfQx8-zU0PvHY8XWi8XR5Yg8dnS_--d4ZO76tjtV7ttmtP6rFJiNtZIaO0KNB2fqyENqIomlbIhBaaTDgwJnWltqJpnNgBFmyCo2zQmkEhY2csdfb9iqux9QPlH7rf3l9lcs_ThI8HQ</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>On the Strong Roman Domination Number of Graphs</title><source>arXiv.org</source><creator>Alvarez-Ruiz, M. P ; Yero, I. Gonzalez ; Mediavilla-Gradolph, T ; Sheikholeslami, S. M ; Valenzuela, J. C</creator><creatorcontrib>Alvarez-Ruiz, M. P ; Yero, I. Gonzalez ; Mediavilla-Gradolph, T ; Sheikholeslami, S. M ; Valenzuela, J. C</creatorcontrib><description>Based on the history that the Emperor Constantine decreed that any undefended place (with no legions) of the Roman Empire must be protected by a "stronger" neighbor place (having two legions), a graph theoretical model called Roman domination in graphs was described. A Roman dominating function for a graph $G=(V,E)$, is a function $f:V\rightarrow \{0,1,2\}$ such that every vertex $v$ with $f(v)=0$ has at least a neighbor $w$ in $G$ for which $f(w)=2$. The Roman domination number of a graph is the minimum weight, $\sum_{v\in V}f(v)$, of a Roman dominating function. In this paper we initiate the study of a new parameter related to Roman domination, which we call strong Roman domination number and denote it by $\gamma_{StR}(G)$. We approach the problem of a Roman domination-type defensive strategy under multiple simultaneous attacks and begin with the study of several mathematical properties of this invariant. In particular, we first show that the decision problem regarding the computation of the strong Roman domination number is NP-complete, even when restricted to bipartite graphs. We obtain several bounds on such a parameter and give some realizability results for it. Moreover, we prove that for any tree $T$ of order $n\ge 3$, $\gamma_{StR}(T)\le 6n/7$ and characterize all extremal trees.</description><identifier>DOI: 10.48550/arxiv.1502.03933</identifier><language>eng</language><subject>Mathematics - Combinatorics</subject><creationdate>2015-02</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,776,881</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/1502.03933$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.1502.03933$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Alvarez-Ruiz, M. P</creatorcontrib><creatorcontrib>Yero, I. Gonzalez</creatorcontrib><creatorcontrib>Mediavilla-Gradolph, T</creatorcontrib><creatorcontrib>Sheikholeslami, S. M</creatorcontrib><creatorcontrib>Valenzuela, J. C</creatorcontrib><title>On the Strong Roman Domination Number of Graphs</title><description>Based on the history that the Emperor Constantine decreed that any undefended place (with no legions) of the Roman Empire must be protected by a "stronger" neighbor place (having two legions), a graph theoretical model called Roman domination in graphs was described. A Roman dominating function for a graph $G=(V,E)$, is a function $f:V\rightarrow \{0,1,2\}$ such that every vertex $v$ with $f(v)=0$ has at least a neighbor $w$ in $G$ for which $f(w)=2$. The Roman domination number of a graph is the minimum weight, $\sum_{v\in V}f(v)$, of a Roman dominating function. In this paper we initiate the study of a new parameter related to Roman domination, which we call strong Roman domination number and denote it by $\gamma_{StR}(G)$. We approach the problem of a Roman domination-type defensive strategy under multiple simultaneous attacks and begin with the study of several mathematical properties of this invariant. In particular, we first show that the decision problem regarding the computation of the strong Roman domination number is NP-complete, even when restricted to bipartite graphs. We obtain several bounds on such a parameter and give some realizability results for it. Moreover, we prove that for any tree $T$ of order $n\ge 3$, $\gamma_{StR}(T)\le 6n/7$ and characterize all extremal trees.</description><subject>Mathematics - Combinatorics</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2015</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotzrFuwjAUQFEvHSraD-hU_0DCc-xnOyMKlFZCIAF79BI7JRKxI5NW7d9XBaa7XR3GXgTkyiLCnNJP_50LhCIHWUr5yOa7wKeT54cpxfDJ93GgwJdx6ANNfQx8-zU0PvHY8XWi8XR5Yg8dnS_--d4ZO76tjtV7ttmtP6rFJiNtZIaO0KNB2fqyENqIomlbIhBaaTDgwJnWltqJpnNgBFmyCo2zQmkEhY2csdfb9iqux9QPlH7rf3l9lcs_ThI8HQ</recordid><startdate>20150213</startdate><enddate>20150213</enddate><creator>Alvarez-Ruiz, M. P</creator><creator>Yero, I. Gonzalez</creator><creator>Mediavilla-Gradolph, T</creator><creator>Sheikholeslami, S. M</creator><creator>Valenzuela, J. C</creator><scope>AKZ</scope><scope>GOX</scope></search><sort><creationdate>20150213</creationdate><title>On the Strong Roman Domination Number of Graphs</title><author>Alvarez-Ruiz, M. P ; Yero, I. Gonzalez ; Mediavilla-Gradolph, T ; Sheikholeslami, S. M ; Valenzuela, J. C</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a673-5da5e5753ce9216712bccaa01646070d0d7c896d1bfd071a8a8457d81465045b3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2015</creationdate><topic>Mathematics - Combinatorics</topic><toplevel>online_resources</toplevel><creatorcontrib>Alvarez-Ruiz, M. P</creatorcontrib><creatorcontrib>Yero, I. Gonzalez</creatorcontrib><creatorcontrib>Mediavilla-Gradolph, T</creatorcontrib><creatorcontrib>Sheikholeslami, S. M</creatorcontrib><creatorcontrib>Valenzuela, J. C</creatorcontrib><collection>arXiv Mathematics</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Alvarez-Ruiz, M. P</au><au>Yero, I. Gonzalez</au><au>Mediavilla-Gradolph, T</au><au>Sheikholeslami, S. M</au><au>Valenzuela, J. C</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>On the Strong Roman Domination Number of Graphs</atitle><date>2015-02-13</date><risdate>2015</risdate><abstract>Based on the history that the Emperor Constantine decreed that any undefended place (with no legions) of the Roman Empire must be protected by a "stronger" neighbor place (having two legions), a graph theoretical model called Roman domination in graphs was described. A Roman dominating function for a graph $G=(V,E)$, is a function $f:V\rightarrow \{0,1,2\}$ such that every vertex $v$ with $f(v)=0$ has at least a neighbor $w$ in $G$ for which $f(w)=2$. The Roman domination number of a graph is the minimum weight, $\sum_{v\in V}f(v)$, of a Roman dominating function. In this paper we initiate the study of a new parameter related to Roman domination, which we call strong Roman domination number and denote it by $\gamma_{StR}(G)$. We approach the problem of a Roman domination-type defensive strategy under multiple simultaneous attacks and begin with the study of several mathematical properties of this invariant. In particular, we first show that the decision problem regarding the computation of the strong Roman domination number is NP-complete, even when restricted to bipartite graphs. We obtain several bounds on such a parameter and give some realizability results for it. Moreover, we prove that for any tree $T$ of order $n\ge 3$, $\gamma_{StR}(T)\le 6n/7$ and characterize all extremal trees.</abstract><doi>10.48550/arxiv.1502.03933</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier DOI: 10.48550/arxiv.1502.03933
ispartof
issn
language eng
recordid cdi_arxiv_primary_1502_03933
source arXiv.org
subjects Mathematics - Combinatorics
title On the Strong Roman Domination Number of Graphs
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-04T01%3A55%3A43IST&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=On%20the%20Strong%20Roman%20Domination%20Number%20of%20Graphs&rft.au=Alvarez-Ruiz,%20M.%20P&rft.date=2015-02-13&rft_id=info:doi/10.48550/arxiv.1502.03933&rft_dat=%3Carxiv_GOX%3E1502_03933%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