{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T22:44:59Z","timestamp":1775083499548,"version":"3.50.1"},"reference-count":2,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2006,10,3]],"date-time":"2006-10-03T00:00:00Z","timestamp":1159833600000},"content-version":"vor","delay-in-days":8982,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Graph Theory"],"published-print":{"date-parts":[[1982,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>A set <jats:italic>D<\/jats:italic> of vertices in a graph is said to be a dominating set if every vertex not in <jats:italic>D<\/jats:italic> is adjacent to some vertex in <jats:italic>D.<\/jats:italic> The domination number \u03b2(<jats:italic>G<\/jats:italic>) of a graph <jats:italic>G<\/jats:italic> is the size of a smallest dominating set. <jats:italic>G<\/jats:italic> is called domination balanced if its vertex set can be partitioned into \u03b2(<jats:italic>G<\/jats:italic>) subsets so that each subset is a smallest dominating set of the complement <jats:italic>G<\/jats:italic> of <jats:italic>G.<\/jats:italic> The purpose of this paper is to characterize these graphs.<\/jats:p>","DOI":"10.1002\/jgt.3190060104","type":"journal-article","created":{"date-parts":[[2007,5,29]],"date-time":"2007-05-29T06:34:08Z","timestamp":1180420448000},"page":"23-32","source":"Crossref","is-referenced-by-count":94,"title":["Domination\u2010balanced graphs"],"prefix":"10.1002","volume":"6","author":[{"given":"Charles","family":"Payan","sequence":"first","affiliation":[]},{"given":"Nguyen Huy","family":"Xuong","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,10,3]]},"reference":[{"key":"e_1_2_1_2_2","volume-title":"Graph Theory","author":"Harary F.","year":"1972"},{"key":"e_1_2_1_3_2","first-page":"728","article-title":"Relations du type Nordhaus\u2010Gaddum pour le nombre d'absorption d'un graphe simple","volume":"274","author":"Jaeger F.","year":"1972","journal-title":"C.R. Acad. Sc. Ser. A"}],"container-title":["Journal of Graph Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fjgt.3190060104","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jgt.3190060104","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,12]],"date-time":"2023-11-12T05:14:55Z","timestamp":1699766095000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/jgt.3190060104"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,3]]},"references-count":2,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1982,3]]}},"alternative-id":["10.1002\/jgt.3190060104"],"URL":"https:\/\/doi.org\/10.1002\/jgt.3190060104","archive":["Portico"],"relation":{},"ISSN":["0364-9024","1097-0118"],"issn-type":[{"value":"0364-9024","type":"print"},{"value":"1097-0118","type":"electronic"}],"subject":[],"published":{"date-parts":[[1982,3]]}}}