{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,14]],"date-time":"2025-05-14T02:44:11Z","timestamp":1747190651999,"version":"3.40.5"},"reference-count":9,"publisher":"Wiley","license":[{"start":{"date-parts":[[2021,3,17]],"date-time":"2021-03-17T00:00:00Z","timestamp":1615939200000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Faculty of Science, Tishreen University, Syria"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Applied Mathematics"],"published-print":{"date-parts":[[2021,3,17]]},"abstract":"<jats:p>An eternal dominating set of a graph <jats:inline-formula>\n                     <a:math xmlns:a=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M2\">\n                        <a:mi>G<\/a:mi>\n                     <\/a:math>\n                  <\/jats:inline-formula> 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 \u201call guards move\u201d 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 \u201call guards move model\u201d is called the <jats:inline-formula>\n                     <c:math xmlns:c=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M3\">\n                        <c:mi>m<\/c:mi>\n                     <\/c:math>\n                  <\/jats:inline-formula>-eternal domination model. The size of the smallest <jats:inline-formula>\n                     <e:math xmlns:e=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M4\">\n                        <e:mi>m<\/e:mi>\n                     <\/e:math>\n                  <\/jats:inline-formula>-eternal dominating set is called the <jats:inline-formula>\n                     <g:math xmlns:g=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M5\">\n                        <g:mi>m<\/g:mi>\n                     <\/g:math>\n                  <\/jats:inline-formula>-eternal domination number and is denoted by <jats:inline-formula>\n                     <i:math xmlns:i=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M6\">\n                        <i:msubsup>\n                           <i:mrow>\n                              <i:mi>\u03b3<\/i:mi>\n                           <\/i:mrow>\n                           <i:mrow>\n                              <i:mi>m<\/i:mi>\n                           <\/i:mrow>\n                           <i:mrow>\n                              <i:mo>\u221e<\/i:mo>\n                           <\/i:mrow>\n                        <\/i:msubsup>\n                        <i:mfenced open=\"(\" close=\")\">\n                           <i:mrow>\n                              <i:mi>G<\/i:mi>\n                           <\/i:mrow>\n                        <\/i:mfenced>\n                     <\/i:math>\n                  <\/jats:inline-formula>. In this paper, we find the domination number of Jahangir graph <jats:inline-formula>\n                     <m:math xmlns:m=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M7\">\n                        <m:msub>\n                           <m:mrow>\n                              <m:mi>J<\/m:mi>\n                           <\/m:mrow>\n                           <m:mrow>\n                              <m:mi>s<\/m:mi>\n                              <m:mo>,<\/m:mo>\n                              <m:mi>m<\/m:mi>\n                           <\/m:mrow>\n                        <\/m:msub>\n                     <\/m:math>\n                  <\/jats:inline-formula> for <jats:inline-formula>\n                     <o:math xmlns:o=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M8\">\n                        <o:mi>s<\/o:mi>\n                        <o:mo>\u2261<\/o:mo>\n                        <o:mn>1<\/o:mn>\n                        <o:mo>,<\/o:mo>\n                        <o:mn>2<\/o:mn>\n                        <o:mtext>\u2009<\/o:mtext>\n                        <o:mfenced open=\"(\" close=\")\">\n                           <o:mrow>\n                              <o:mi mathvariant=\"normal\">mod<\/o:mi>\n                              <o:mtext>\u2009<\/o:mtext>\n                              <o:mn>3<\/o:mn>\n                           <\/o:mrow>\n                        <\/o:mfenced>\n                     <\/o:math>\n                  <\/jats:inline-formula>, and the <jats:inline-formula>\n                     <t:math xmlns:t=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M9\">\n                        <t:mi>m<\/t:mi>\n                     <\/t:math>\n                  <\/jats:inline-formula>-eternal domination numbers of <jats:inline-formula>\n                     <v:math xmlns:v=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M10\">\n                        <v:msub>\n                           <v:mrow>\n                              <v:mi>J<\/v:mi>\n                           <\/v:mrow>\n                           <v:mrow>\n                              <v:mi>s<\/v:mi>\n                              <v:mo>,<\/v:mo>\n                              <v:mi>m<\/v:mi>\n                           <\/v:mrow>\n                        <\/v:msub>\n                     <\/v:math>\n                  <\/jats:inline-formula> for <jats:inline-formula>\n                     <x:math xmlns:x=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M11\">\n                        <x:mi>s<\/x:mi>\n                        <x:mo>,<\/x:mo>\n                        <x:mi>m<\/x:mi>\n                     <\/x:math>\n                  <\/jats:inline-formula> are arbitraries.<\/jats:p>","DOI":"10.1155\/2021\/8882598","type":"journal-article","created":{"date-parts":[[2021,3,18]],"date-time":"2021-03-18T20:35:08Z","timestamp":1616099708000},"page":"1-7","source":"Crossref","is-referenced-by-count":0,"title":["On Eternal Domination of Generalized <a:math xmlns:a=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M1\">\n                     <a:msub>\n                        <a:mrow>\n                           <a:mi>J<\/a:mi>\n                        <\/a:mrow>\n                        <a:mrow>\n                           <a:mi>s<\/a:mi>\n                           <a:mo>,<\/a:mo>\n                           <a:mi>m<\/a:mi>\n                        <\/a:mrow>\n                     <\/a:msub>\n                  <\/a:math>"],"prefix":"10.1155","volume":"2021","author":[{"given":"Ramy","family":"Shaheen","sequence":"first","affiliation":[{"name":"Department of Mathematics, Faculty of Science, Tishreen University, Lattakia, Syria"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6697-0275","authenticated-orcid":true,"given":"Mohammad","family":"Assaad","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Faculty of Science, Tishreen University, Lattakia, Syria"}]},{"given":"Ali","family":"Kassem","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Faculty of Science, Tishreen University, Lattakia, Syria"}]}],"member":"311","reference":[{"key":"1","doi-asserted-by":"publisher","DOI":"10.2298\/AADM151109021K"},{"key":"2","first-page":"179","article-title":"Infinite order domination in graphs","volume":"50","author":"A. P. Burger","year":"2004","journal-title":"Journal of Combinatorial Mathematics and Combinatorial Computing"},{"key":"3","first-page":"169","article-title":"Eternal security in graphs","volume":"52","author":"W. Goddard","year":"2005","journal-title":"Journal of Combinatorial Mathematics and Combinatorial Computing"},{"key":"4","first-page":"156","article-title":"Eternal domination in 3\u00d7 n grids","volume":"61","author":"S. Finbow","year":"2015","journal-title":"The Australasian Journal of Combinatorics"},{"issue":"1","key":"5","first-page":"47","article-title":"CLOSING THE GAP: eternal domination on 3 \u00d7n\u2009Grids","volume":"12","author":"M. E. Messinger","year":"2017","journal-title":"Contributions to Discrete Mathematics"},{"key":"6","first-page":"47","article-title":"Eternal protection in grid graphs","volume":"91","author":"J. Goldwasser","year":"2013","journal-title":"Utilitas Mathematica"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.12988\/ijcms.2007.07122"},{"key":"8","first-page":"113","article-title":"Some domination parameters in generalized Jahangir graph Jn,m. Malaysian","volume":"13","author":"S. Mtarneh","year":"2019","journal-title":"Journal of Mathematical Sciences"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.4236\/ojdm.2019.93008"}],"container-title":["Journal of Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/jam\/2021\/8882598.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/jam\/2021\/8882598.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/jam\/2021\/8882598.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,18]],"date-time":"2021-03-18T20:35:17Z","timestamp":1616099717000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.hindawi.com\/journals\/jam\/2021\/8882598\/"}},"subtitle":[],"editor":[{"given":"Frank","family":"Werner","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2021,3,17]]},"references-count":9,"alternative-id":["8882598","8882598"],"URL":"https:\/\/doi.org\/10.1155\/2021\/8882598","relation":{},"ISSN":["1687-0042","1110-757X"],"issn-type":[{"type":"electronic","value":"1687-0042"},{"type":"print","value":"1110-757X"}],"subject":[],"published":{"date-parts":[[2021,3,17]]}}}