{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,17]],"date-time":"2026-02-17T11:51:38Z","timestamp":1771329098721,"version":"3.50.1"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,4,24]],"date-time":"2021-04-24T00:00:00Z","timestamp":1619222400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,4,24]],"date-time":"2021-04-24T00:00:00Z","timestamp":1619222400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2022,1]]},"DOI":"10.1007\/s10878-021-00743-z","type":"journal-article","created":{"date-parts":[[2021,4,25]],"date-time":"2021-04-25T04:17:53Z","timestamp":1619324273000},"page":"28-41","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Independent domination in subcubic graphs"],"prefix":"10.1007","volume":"43","author":[{"given":"A.","family":"Akbari","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Akbari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Doosthosseini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Z.","family":"Hadizadeh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael A.","family":"Henning","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Naraghi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,4,24]]},"reference":[{"key":"743_CR1","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/j.disc.2017.08.025","volume":"341","author":"G Abrishami","year":"2018","unstructured":"Abrishami G, Henning MA (2018) Independent domination in subcubic graphs of girth at least six. Discrete Math. 341:155\u2013164","journal-title":"Discrete Math."},{"issue":"4","key":"743_CR2","doi-asserted-by":"publisher","first-page":"881","DOI":"10.1007\/s00373-019-02043-0","volume":"35","author":"C Brause","year":"2019","unstructured":"Brause C, Henning MA (2019) Independent domination in bipartite cubic graphs. Graphs Combin. 35(4):881\u2013919","journal-title":"Graphs Combin."},{"issue":"4","key":"743_CR3","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1002\/jgt.21855","volume":"80","author":"P Dorbec","year":"2015","unstructured":"Dorbec P, Henning MA, Montassier M, Southey J (2015) Independent domination in cubic graphs. J. Graph Theory 80(4):329\u2013349","journal-title":"J. Graph Theory"},{"key":"743_CR4","first-page":"19","volume":"1","author":"O Favaron","year":"1992","unstructured":"Favaron O (1992) A bound on the independent domination number of a tree. Vishwa Int. J. Graph Theory 1:19\u201327","journal-title":"Vishwa Int. J. Graph Theory"},{"key":"743_CR5","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/j.dam.2014.06.005","volume":"178","author":"M Furuya","year":"2014","unstructured":"Furuya M, Ozeki K, Sasaki A (2014) On the ratio of the domination number and the independent domination number in graphs. Discrete Appl. Math. 178:157\u2013159","journal-title":"Discrete Appl. Math."},{"key":"743_CR6","doi-asserted-by":"publisher","first-page":"839","DOI":"10.1016\/j.disc.2012.11.031","volume":"313","author":"W Goddard","year":"2013","unstructured":"Goddard W, Henning MA (2013) Independent domination in graphs: a survey and recent results. Discrete Math. 313:839\u2013854","journal-title":"Discrete Math."},{"issue":"1","key":"743_CR7","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/s10878-010-9336-4","volume":"23","author":"W Goddard","year":"2012","unstructured":"Goddard W, Lyle J (2012) Independent dominating sets in triangle-free graphs. J. Comb. Optim. 23(1):9\u201320","journal-title":"J. Comb. Optim."},{"key":"743_CR8","doi-asserted-by":"publisher","first-page":"719","DOI":"10.1007\/s00026-012-0155-4","volume":"16","author":"W Goddard","year":"2012","unstructured":"Goddard W, Henning MA, Lyle J, Southey J (2012) On the independent domination number of regular graphs. Ann. Combin. 16:719\u2013732","journal-title":"Ann. Combin."},{"key":"743_CR9","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/0012-365X(94)00022-B","volume":"143","author":"J Haviland","year":"1995","unstructured":"Haviland J (1995) Independent domination in regular graphs. Discrete Math. 143:275\u2013280","journal-title":"Discrete Math."},{"key":"743_CR10","doi-asserted-by":"publisher","first-page":"2643","DOI":"10.1016\/j.disc.2007.01.001","volume":"307","author":"J Haviland","year":"2007","unstructured":"Haviland J (2007) Upper bounds for independent domination in regular graphs. Discrete Math. 307:2643\u20132646","journal-title":"Discrete Math."},{"key":"743_CR11","unstructured":"Henning MA, Yeo A (2013) Total domination in graphs (Springer monographs in mathematics), ISBN: 978-1-4614-6524-9 (Print) 978-1-4614-6525-6 (Online)"},{"key":"743_CR12","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1016\/j.dam.2013.08.035","volume":"162","author":"MA Henning","year":"2014","unstructured":"Henning MA, L\u00f6wenstein C, Rautenbach D (2014) Independent domination in subcubic bipartite graphs of girth at least six. Discrete Appl. Math. 162:399\u2013403","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"743_CR13","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/BF02988312","volume":"9","author":"AV Kostochka","year":"1993","unstructured":"Kostochka AV (1993) The independent domination number of a cubic $$3$$-connected graph can be much larger than its domination number. Graphs Combin. 9(3):235\u2013237","journal-title":"Graphs Combin."},{"key":"743_CR14","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/S0012-365X(98)00350-1","volume":"202","author":"PCB Lam","year":"1999","unstructured":"Lam PCB, Shiu WC, Sun L (1999) On independent domination number of regular graphs. Discrete Math. 202:135\u2013144","journal-title":"Discrete Math."},{"issue":"2","key":"743_CR15","doi-asserted-by":"publisher","first-page":"P2.38","DOI":"10.37236\/3881","volume":"21","author":"J Lyle","year":"2014","unstructured":"Lyle J (2014) A note on independent sets in graphs with large minimum degree and small cliques. Electr. J. Comb. 21(2):P2.38","journal-title":"Electr. J. Comb."},{"issue":"5","key":"743_CR16","doi-asserted-by":"publisher","first-page":"1567","DOI":"10.1007\/s00373-014-1454-9","volume":"31","author":"J Lyle","year":"2015","unstructured":"Lyle J (2015) A structural approach for independent domination of regular graphs. Graphs Combin. 31(5):1567\u20131588","journal-title":"Graphs Combin."},{"key":"743_CR17","doi-asserted-by":"publisher","first-page":"3087","DOI":"10.1016\/j.dam.2013.07.009","volume":"161","author":"NJ Rad","year":"2013","unstructured":"Rad NJ, Volkmann L (2013) A note on the independent domination number in graphs. Discrete Appl. Math. 161:3087\u20133089","journal-title":"Discrete Appl. Math."},{"issue":"11","key":"743_CR18","doi-asserted-by":"publisher","first-page":"1212","DOI":"10.1016\/j.disc.2012.01.003","volume":"313","author":"J Southey","year":"2013","unstructured":"Southey J, Henning MA (2013) Domination versus independent domination in cubic graphs. Discrete Math. 313(11):1212\u20131220","journal-title":"Discrete Math."},{"issue":"2","key":"743_CR19","doi-asserted-by":"publisher","first-page":"773","DOI":"10.1007\/s00373-015-1580-z","volume":"32","author":"O Suil","year":"2016","unstructured":"Suil O, West DB (2016) Cubic graphs with large ratio of independent domination number to domination number. Graphs Combin. 32(2):773\u2013776","journal-title":"Graphs Combin."},{"issue":"2","key":"743_CR20","doi-asserted-by":"publisher","first-page":"533","DOI":"10.21136\/CMJ.2017.0068-16","volume":"67","author":"S Wang","year":"2017","unstructured":"Wang S, Wei B (2017) A note on the independent domination number versus the domination number in bipartite graphs. Czechoslovak Math. J. 67(2):533\u2013536","journal-title":"Czechoslovak Math. J."}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-021-00743-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-021-00743-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-021-00743-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,29]],"date-time":"2022-01-29T08:15:19Z","timestamp":1643444119000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-021-00743-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4,24]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,1]]}},"alternative-id":["743"],"URL":"https:\/\/doi.org\/10.1007\/s10878-021-00743-z","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,4,24]]},"assertion":[{"value":"8 April 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 April 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}