Roman game domination subdivision number of a graph
A {em Roman dominating function} on a graph $G = (V ,E)$ is a function $f : Vlongrightarrow {0, 1, 2}$ satisfying the condition that every vertex $v$ for which $f (v) = 0$ is adjacent to at least one vertex $u$ for which $f (u) = 2$. The {em weight} of a Roman dominating function is the value $w(f)=...
Saved in:
Published in | Transactions on combinatorics Vol. 2; no. 4; pp. 1 - 12 |
---|---|
Main Authors | , , , |
Format | Journal Article |
Language | English |
Published |
University of Isfahan
01.12.2013
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Abstract | A {em Roman dominating function} on a graph $G = (V ,E)$ is a function $f : Vlongrightarrow {0, 1, 2}$ satisfying the condition that every vertex $v$ for which $f (v) = 0$ is adjacent to at least one vertex $u$ for which $f (u) = 2$. The {em weight} of a Roman dominating function is the value $w(f)=sum_{vin V}f(v)$. The Roman domination number of a graph $G$, denoted by $gamma_R(G)$, equals the minimum weight of a Roman dominating function on G. The Roman game domination subdivision number of a graph $G$ is defined by the following game. Two players $mathcal D$ and $mathcal A$, $mathcal D$ playing first, alternately mark or subdivide an edge of $G$ which is not yet marked nor subdivided. The game ends when all the edges of $G$ are marked or subdivided and results in a new graph $G'$. The purpose of $mathcal D$ is to minimize the Roman dominating number $gamma_R(G')$ of $G'$ while $mathcal A$ tries to maximize it. If both $mathcal A$ and $mathcal D$ play according to their optimal strategies, $gamma_R(G')$ is well defined. We call this number the {em Roman game domination subdivision number} of $G$ and denote it by $gamma_{Rgs}(G)$. In this paper we initiate the study of the Roman game domination subdivision number of a graph and present sharp bounds on the Roman game domination subdivision number of a tree. |
---|---|
AbstractList | A {em Roman dominating function} on a graph $G = (V ,E)$ is a function $f : Vlongrightarrow {0, 1, 2}$ satisfying the condition that every vertex $v$ for which $f (v) = 0$ is adjacent to at least one vertex $u$ for which $f (u) = 2$. The {em weight} of a Roman dominating function is the value $w(f)=sum_{vin V}f(v)$. The Roman domination number of a graph $G$, denoted by $gamma_R(G)$, equals the minimum weight of a Roman dominating function on G. The Roman game domination subdivision number of a graph $G$ is defined by the following game. Two players $mathcal D$ and $mathcal A$, $mathcal D$ playing first, alternately mark or subdivide an edge of $G$ which is not yet marked nor subdivided. The game ends when all the edges of $G$ are marked or subdivided and results in a new graph $G'$. The purpose of $mathcal D$ is to minimize the Roman dominating number $gamma_R(G')$ of $G'$ while $mathcal A$ tries to maximize it. If both $mathcal A$ and $mathcal D$ play according to their optimal strategies, $gamma_R(G')$ is well defined. We call this number the {em Roman game domination subdivision number} of $G$ and denote it by $gamma_{Rgs}(G)$. In this paper we initiate the study of the Roman game domination subdivision number of a graph and present sharp bounds on the Roman game domination subdivision number of a tree. |
Author | Seyed Mahmoud Sheikholeslami Hossein Karami Jafar Amjadi Lutz Volkmann |
Author_xml | – sequence: 1 fullname: Jafar Amjadi – sequence: 2 fullname: Hossein Karami – sequence: 3 fullname: Seyed Mahmoud Sheikholeslami – sequence: 4 fullname: Lutz Volkmann |
BookMark | eNo9jNlqwzAUREVJoWmaf9APGLRYsu9jCF0CgUJon82Vr-woxFKQnUL_vu5CYWDODMPcs0VM0d-wpVJGFrW1ZvHPprpj63E8CSGk1KClXjJ9SANG3uPgOaUhRJxCiny8OgofYfzmeB2czzx1HHmf8XJ8YLcdnke__vMVe396fNu-FPvX5912sy9IGjkVBKKbZUQntVOuUuQtVFY6oyon2k652igqQTqv6krXKPQ8L0G0hAYk6RXb_f5SwlNzyWHA_NkkDM1PkXLfYJ5Ce_YNggUQigwIKEtCbFVpJZKbM7ZC6y_8LFAM |
ContentType | Journal Article |
DBID | DOA |
DatabaseName | DOAJ Directory of Open Access Journals |
DatabaseTitleList | |
Database_xml | – sequence: 1 dbid: DOA name: DOAJ Directory of Open Access Journals url: https://www.doaj.org/ sourceTypes: Open Website |
DeliveryMethod | fulltext_linktorsrc |
Discipline | Mathematics |
EISSN | 2251-8665 |
EndPage | 12 |
ExternalDocumentID | oai_doaj_org_article_a969902d590944daac2461adb909ac03 |
GroupedDBID | 5VS ABDBF ADBBV ALMA_UNASSIGNED_HOLDINGS BCNDV EOJEC GROUPED_DOAJ IPNFZ KQ8 M~E OBODZ OK1 RIG TUS |
ID | FETCH-LOGICAL-d151t-d90f90f50f13b2b72de69761b527b0cf2b852d491be28738a0390f490cda591d3 |
IEDL.DBID | DOA |
ISSN | 2251-8657 |
IngestDate | Thu Jul 04 21:09:27 EDT 2024 |
IsOpenAccess | true |
IsPeerReviewed | true |
IsScholarly | true |
Issue | 4 |
Language | English |
LinkModel | DirectLink |
MergedId | FETCHMERGED-LOGICAL-d151t-d90f90f50f13b2b72de69761b527b0cf2b852d491be28738a0390f490cda591d3 |
OpenAccessLink | https://doaj.org/article/a969902d590944daac2461adb909ac03 |
PageCount | 12 |
ParticipantIDs | doaj_primary_oai_doaj_org_article_a969902d590944daac2461adb909ac03 |
PublicationCentury | 2000 |
PublicationDate | 2013-12-01 |
PublicationDateYYYYMMDD | 2013-12-01 |
PublicationDate_xml | – month: 12 year: 2013 text: 2013-12-01 day: 01 |
PublicationDecade | 2010 |
PublicationTitle | Transactions on combinatorics |
PublicationYear | 2013 |
Publisher | University of Isfahan |
Publisher_xml | – name: University of Isfahan |
SSID | ssj0001139313 ssib044763210 |
Score | 1.9152931 |
Snippet | A {em Roman dominating function} on a graph $G = (V ,E)$ is a function $f : Vlongrightarrow {0, 1, 2}$ satisfying the condition that every vertex $v$ for which... |
SourceID | doaj |
SourceType | Open Website |
StartPage | 1 |
SubjectTerms | Roman domination number Roman game domination subdivision number tree |
Title | Roman game domination subdivision number of a graph |
URI | https://doaj.org/article/a969902d590944daac2461adb909ac03 |
Volume | 2 |
hasFullText | 1 |
inHoldings | 1 |
isFullTextHit | |
isPrint | |
link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV27asMwFBUlXdqh9EmfQUNXU-tlR2Pc1oRCOpQGshlJV-oUuzTJ_-dKNiVbl4IXGWPjq8c5V1ydQ8gjcwV46yQyN6cy5LeQaeDYIS4UeSiFlDqed56_F7OFfFuq5Z7VV6wJ6-WB-8A9GV3ggslBaUxEJBjjogKaAYtt4wadT6b2kikcSVLitOEDsKXdFiQ6Inkl4_hl2aSIcLQn0p_QpD4lJwMNpNP-82fkwLfn5Hj-q6G6viDio1uZln6ZlafQxYqVGEO63tp4hCpuctHezoN2gRqalKcvyaJ-_XyeZYPFQQYItZsMdB7wUnlgwnJbcvAFEgRmFS9t7gK3E8VBamY9pjZiYnKBj0udOzBKMxBXZNR2rb8m1AIXHhgPOCWlCSVSKcujNg5ivDaa3ZAq_m_z3atYNFFXOt3AaDdDtJu_on37Hy-5I0c8mkqkopB7Mtr8bP0DQvvGjsnhtHqp6nHqzR2O1qC7 |
link.rule.ids | 315,786,790,2115 |
linkProvider | Directory of Open Access Journals |
openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Roman+game+domination+subdivision+number+of+a+graph&rft.jtitle=Transactions+on+combinatorics&rft.au=Jafar+Amjadi&rft.au=Hossein+Karami&rft.au=Seyed+Mahmoud+Sheikholeslami&rft.au=Lutz+Volkmann&rft.date=2013-12-01&rft.pub=University+of+Isfahan&rft.issn=2251-8657&rft.eissn=2251-8665&rft.volume=2&rft.issue=4&rft.spage=1&rft.epage=12&rft.externalDBID=DOA&rft.externalDocID=oai_doaj_org_article_a969902d590944daac2461adb909ac03 |
thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2251-8657&client=summon |
thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2251-8657&client=summon |
thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2251-8657&client=summon |