{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T23:59:22Z","timestamp":1740182362205,"version":"3.37.3"},"reference-count":8,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T00:00:00Z","timestamp":1672185600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T00:00:00Z","timestamp":1672185600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Oper. Res. Forum"],"DOI":"10.1007\/s43069-022-00186-0","type":"journal-article","created":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T11:05:50Z","timestamp":1672225550000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Iterative\u00a0Construction of the Minimum Independent Dominating Sets in Hypercube Graphs"],"prefix":"10.1007","volume":"4","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9679-894X","authenticated-orcid":false,"given":"Debabani","family":"Chowdhury","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,12,28]]},"reference":[{"key":"186_CR1","doi-asserted-by":"crossref","unstructured":"Lozin V, Mosca R, Purcell C (2015) Independent domination in finitely defined classes of graphs: Polynomial algorithms. Discret Appl Math 182:2-14. https:\/\/doi.org\/10.1016\/j.dam.2013.08.030","DOI":"10.1016\/j.dam.2013.08.030"},{"key":"186_CR2","doi-asserted-by":"crossref","unstructured":"Gaspers S, Liedloff M (2006) A branch-and-reduce algorithm for finding a minimum independent dominating set in graphs. In: Fomin, F.V. (eds) Graph-Theoretic concepts in Computer Science, WG, Lecture Notes in Computer Science 4271. Springer, Berlin, Heidelberg. https:\/\/doi.org\/10.1007\/11917496_8","DOI":"10.1007\/11917496_8"},{"key":"186_CR3","doi-asserted-by":"crossref","unstructured":"Irving RW (1991) On approximating the minimum independent dominating set. Inform Process Lett 37:4:197-200. https:\/\/doi.org\/10.1016\/0020-0190(91)90188-N","DOI":"10.1016\/0020-0190(91)90188-N"},{"key":"186_CR4","doi-asserted-by":"crossref","unstructured":"Harary F, Livingston M (1993) Independent domination in hypercubes. Appl Math Lett 6:3:27-28. https:\/\/doi.org\/10.1016\/0893-9659(93)90027-K","DOI":"10.1016\/0893-9659(93)90027-K"},{"key":"186_CR5","unstructured":"Chowdhury D, Das DK, Bhattacharya BB (2022) Improved Upper Bound on Independent Domination Number for Hypercubes. arXiv identifier:\u00a0http:\/\/arxiv.org\/abs\/2205.06671"},{"key":"186_CR6","doi-asserted-by":"crossref","unstructured":"Haynes TW, Hedetniemi ST, Slater PJ (1998) Domination in Graphs Advanced Topics. Marcel Decker, New York","DOI":"10.1002\/(SICI)1097-0037(199810)32:3<199::AID-NET4>3.0.CO;2-F"},{"key":"186_CR7","unstructured":"Mane SA, Waphare BN, Haynes TW (2012) On Independent and (d, n)-domination numbers of hypercubes. AKCE Int J Graphs Comb 9(2):161\u2013168"},{"issue":"4","key":"186_CR8","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1002\/jgt.1016","volume":"37","author":"J Lee","year":"2001","unstructured":"Lee J (2001) Independent perfect domination sets in Cayley Graphs. J. Graph Theory. 37(4):213\u2013219","journal-title":"J. Graph Theory."}],"container-title":["Operations Research Forum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43069-022-00186-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s43069-022-00186-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43069-022-00186-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,25]],"date-time":"2023-04-25T07:08:15Z","timestamp":1682406495000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s43069-022-00186-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12,28]]},"references-count":8,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2023,3]]}},"alternative-id":["186"],"URL":"https:\/\/doi.org\/10.1007\/s43069-022-00186-0","relation":{},"ISSN":["2662-2556"],"issn-type":[{"type":"electronic","value":"2662-2556"}],"subject":[],"published":{"date-parts":[[2022,12,28]]},"assertion":[{"value":"25 June 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 December 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 December 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The author declares no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing Interests"}}],"article-number":"4"}}