{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,12]],"date-time":"2026-08-12T21:28:11Z","timestamp":1786570091376,"version":"3.56.0"},"reference-count":14,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100006565","name":"University of Johannesburg","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100006565","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001321","name":"National Research Foundation","doi-asserted-by":"publisher","award":["132588"],"award-info":[{"award-number":["132588"]}],"id":[{"id":"10.13039\/501100001321","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Optimization"],"published-print":{"date-parts":[[2026,8]]},"DOI":"10.1016\/j.disopt.2026.100959","type":"journal-article","created":{"date-parts":[[2026,8,10]],"date-time":"2026-08-10T06:18:40Z","timestamp":1786342720000},"page":"100959","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["On the isolation number of graphs with minimum degree four"],"prefix":"10.1016","volume":"61","author":[{"given":"Wayne","family":"Goddard","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michael A.","family":"Henning","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.disopt.2026.100959_b1","doi-asserted-by":"crossref","first-page":"3925","DOI":"10.2298\/FIL1712925C","article-title":"Partial domination \u2014 the isolation number of a graph","volume":"31","author":"Caro","year":"2017","journal-title":"Filomat"},{"key":"10.1016\/j.disopt.2026.100959_b2","series-title":"Theoretical and Algorithmic Results on Domination and Connectivity","author":"Peters","year":"1986"},{"key":"10.1016\/j.disopt.2026.100959_b3","doi-asserted-by":"crossref","first-page":"735","DOI":"10.1007\/s00010-018-0609-9","article-title":"Vertex-edge domination in graphs","volume":"93","author":"Zyli\u0144ski","year":"2019","journal-title":"Aequationes Math."},{"key":"10.1016\/j.disopt.2026.100959_b4","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1016\/j.crma.2014.03.017","article-title":"Bounds on the vertex-edge domination number of a tree","volume":"352","author":"Krishnakumari","year":"2014","journal-title":"C. R. Math. Acad. Sci. Paris"},{"key":"10.1016\/j.disopt.2026.100959_b5","article-title":"Isolation number versus domination number of trees","volume":"9","author":"Dapena","year":"2021","journal-title":"Mathematics"},{"key":"10.1016\/j.disopt.2026.100959_b6","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1016\/j.dam.2024.05.022","article-title":"Disjoint isolating sets and graphs with maximum isolation number","volume":"356","author":"Boyer","year":"2024","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.disopt.2026.100959_b7","doi-asserted-by":"crossref","DOI":"10.1016\/j.disc.2020.112075","article-title":"Vertex-edge domination in cubic graphs","volume":"343","author":"Ziemann","year":"2020","journal-title":"Discrete Math."},{"key":"10.1016\/j.disopt.2026.100959_b8","doi-asserted-by":"crossref","first-page":"915","DOI":"10.1016\/j.disc.2013.01.014","article-title":"Domination game played on trees and spanning subgraphs","volume":"313","author":"Bre\u0161ar","year":"2013","journal-title":"Discrete Math."},{"key":"10.1016\/j.disopt.2026.100959_b9","doi-asserted-by":"crossref","first-page":"2090","DOI":"10.1137\/120884742","article-title":"Extremal problems for game domination number","volume":"27","author":"Kinnersley","year":"2013","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/j.disopt.2026.100959_b10","doi-asserted-by":"crossref","first-page":"763","DOI":"10.7151\/dmgt.2339","article-title":"Domination number of graphs with minimum degree five","volume":"41","author":"Bujt\u00e1s","year":"2021","journal-title":"Discuss. Math. Graph Theory"},{"key":"10.1016\/j.disopt.2026.100959_b11","doi-asserted-by":"crossref","DOI":"10.1016\/j.disc.2021.112449","article-title":"On the domination number of graphs with minimum degree six","volume":"344","author":"Bujt\u00e1s","year":"2021","journal-title":"Discrete Math."},{"key":"10.1016\/j.disopt.2026.100959_b12","doi-asserted-by":"crossref","DOI":"10.1016\/j.disc.2025.114424","article-title":"On the domination number of graphs with minimum degree at least seven","volume":"348","author":"Bujt\u00e1s","year":"2025","journal-title":"Discrete Math."},{"key":"10.1016\/j.disopt.2026.100959_b13","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1007\/s00373-015-1585-7","article-title":"Improved upper bounds on the domination number of graphs with minimum degree at least five","volume":"32","author":"Bujt\u00e1s","year":"2016","journal-title":"Graphs Combin."},{"key":"10.1016\/j.disopt.2026.100959_b14","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-031-09496-5","article-title":"Domination in graphs: Core concepts","author":"Haynes","year":"2023"}],"container-title":["Discrete Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1572528626000320?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1572528626000320?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,8,12]],"date-time":"2026-08-12T20:38:37Z","timestamp":1786567117000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1572528626000320"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8]]},"references-count":14,"alternative-id":["S1572528626000320"],"URL":"https:\/\/doi.org\/10.1016\/j.disopt.2026.100959","relation":{},"ISSN":["1572-5286"],"issn-type":[{"value":"1572-5286","type":"print"}],"subject":[],"published":{"date-parts":[[2026,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"On the isolation number of graphs with minimum degree four","name":"articletitle","label":"Article Title"},{"value":"Discrete Optimization","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.disopt.2026.100959","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"100959"}}