{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,25]],"date-time":"2026-06-25T06:48:12Z","timestamp":1782370092293,"version":"3.54.5"},"reference-count":27,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2018,7,2]],"date-time":"2018-07-02T00:00:00Z","timestamp":1530489600000},"content-version":"vor","delay-in-days":182,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11361008"],"award-info":[{"award-number":["11361008"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Complexity"],"published-print":{"date-parts":[[2018,1]]},"abstract":"<jats:p>Domination is a structural complexity of chemical molecular graphs. A dominating set in a (molecular) graph <jats:italic>G<\/jats:italic> = (<jats:italic>V<\/jats:italic>, <jats:italic>E<\/jats:italic>) is a subset <jats:italic>S<\/jats:italic>\u2286<jats:italic>V<\/jats:italic> such that each vertex in <jats:italic>V<\/jats:italic>\\<jats:italic>S<\/jats:italic> is adjacent to at least one vertex in <jats:italic>S<\/jats:italic>. The domination number <jats:italic>\u03b3<\/jats:italic>(<jats:italic>G<\/jats:italic>) of a graph <jats:italic>G<\/jats:italic> is the minimum size of a dominating set in <jats:italic>G<\/jats:italic>. In this paper, computer\u2010aided approaches for obtaining bounds for domination number on torus graphs are here considered, and many new exact values and bounds are obtained.<\/jats:p>","DOI":"10.1155\/2018\/3041426","type":"journal-article","created":{"date-parts":[[2018,7,3]],"date-time":"2018-07-03T00:01:47Z","timestamp":1530576107000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["The Domination Complexity and Related Extremal Values of Large 3D Torus"],"prefix":"10.1155","volume":"2018","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0764-4135","authenticated-orcid":false,"given":"Zehui","family":"Shao","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jin","family":"Xu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"S. M.","family":"Sheikholeslami","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6941-3194","authenticated-orcid":false,"given":"Shaohui","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"311","published-online":{"date-parts":[[2018,7,2]]},"reference":[{"key":"e_1_2_7_1_2","volume-title":"Fundamentals of Domination in Graphs","author":"Haynes T. W.","year":"1998"},{"key":"e_1_2_7_2_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(90)90365-O"},{"key":"e_1_2_7_3_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.apm.2018.03.016"},{"key":"e_1_2_7_4_2","doi-asserted-by":"publisher","DOI":"10.21136\/CMJ.2017.0068-16"},{"key":"e_1_2_7_5_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jmaa.2017.09.005"},{"key":"e_1_2_7_6_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10910-018-0877-6"},{"key":"e_1_2_7_7_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2015.07.001"},{"key":"e_1_2_7_8_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2009.01.018"},{"key":"e_1_2_7_9_2","doi-asserted-by":"publisher","DOI":"10.1007\/s40314-013-0077-8"},{"key":"e_1_2_7_10_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2008.05.026"},{"key":"e_1_2_7_11_2","first-page":"373","article-title":"On the domination number of generalized Petersen graphs P(n,3)","volume":"84","author":"Fu X.","year":"2007","journal-title":"Ars Combinatoria"},{"key":"e_1_2_7_12_2","volume-title":"Covering Codes","author":"Cohen G.","year":"1997"},{"key":"e_1_2_7_13_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2013.12.005"},{"key":"e_1_2_7_14_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.camwa.2011.03.012"},{"key":"e_1_2_7_15_2","doi-asserted-by":"publisher","DOI":"10.21136\/MB.1993.126050"},{"key":"e_1_2_7_16_2","unstructured":"GorodezkyI. Domination in Kneser Graphs [M.S. thesis] 2007 University of Waterloo Waterloo Canada."},{"key":"e_1_2_7_17_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2018.03.058"},{"key":"e_1_2_7_18_2","first-page":"197","article-title":"Bounds on the domination number of Kneser graphs","volume":"9","author":"\u00d6sterg\u00e5rd P.","year":"2015","journal-title":"Ars Mathematica Contemporanea"},{"key":"e_1_2_7_19_2","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(93)E0167-W"},{"key":"e_1_2_7_20_2","first-page":"51","article-title":"On the domination number of the product of two cycles","volume":"84","author":"El-Zahar M. H.","year":"2007","journal-title":"Ars Combinatoria"},{"key":"e_1_2_7_21_2","unstructured":"CrevalsS.and\u00d6sterg\u00e5rdP. R. J. On the domination number of 2-dimensional torus graphs Utilitas Mathematica 2018 106 289\u2013300."},{"key":"e_1_2_7_22_2","doi-asserted-by":"publisher","DOI":"10.37236\/628"},{"key":"e_1_2_7_23_2","doi-asserted-by":"publisher","DOI":"10.1137\/11082574"},{"key":"e_1_2_7_24_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10440-009-9534-1"},{"key":"e_1_2_7_25_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-012-9515-6"},{"key":"e_1_2_7_26_2","doi-asserted-by":"publisher","DOI":"10.1038\/srep19066"},{"key":"e_1_2_7_27_2","doi-asserted-by":"publisher","DOI":"10.1002\/jcd.20008"}],"container-title":["Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2018\/3041426.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2018\/3041426.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1155\/2018\/3041426","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,8]],"date-time":"2024-08-08T23:03:36Z","timestamp":1723158216000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1155\/2018\/3041426"}},"subtitle":[],"editor":[{"given":"Christos","family":"Volos","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"editor"}]}],"short-title":[],"issued":{"date-parts":[[2018,1]]},"references-count":27,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,1]]}},"alternative-id":["10.1155\/2018\/3041426"],"URL":"https:\/\/doi.org\/10.1155\/2018\/3041426","archive":["Portico"],"relation":{},"ISSN":["1076-2787","1099-0526"],"issn-type":[{"value":"1076-2787","type":"print"},{"value":"1099-0526","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,1]]},"assertion":[{"value":"2018-01-18","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-04-15","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-07-02","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"3041426"}}