{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T13:03:20Z","timestamp":1768568600295,"version":"3.49.0"},"reference-count":6,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5311,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1999,1]]},"DOI":"10.1016\/s0166-218x(98)00082-1","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T12:12:16Z","timestamp":1027599136000},"page":"299-303","source":"Crossref","is-referenced-by-count":5,"title":["A note on graphs with large girth and small minus domination number"],"prefix":"10.1016","volume":"91","author":[{"given":"Jaeun","family":"Lee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Moo Young","family":"Sohn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hye Kyung","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(98)00082-1_BIB1","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0166-218X(95)00056-W","article-title":"The algorithmic complexity of minus domination in graphs","volume":"68","author":"Dunbar","year":"1996","journal-title":"Disc. Appl. Math."},{"key":"10.1016\/S0166-218X(98)00082-1_BIB2","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/0012-365X(94)00329-H","article-title":"Minus domination in regular graphs","volume":"149","author":"Dunbar","year":"1996","journal-title":"Disc. Math."},{"key":"10.1016\/S0166-218X(98)00082-1_BIB3","series-title":"Minus domination in graphs","author":"Dunbar","year":"1998"},{"key":"10.1016\/S0166-218X(98)00082-1_BIB4","series-title":"Topological Graph Theory","author":"Gross","year":"1987"},{"key":"10.1016\/S0166-218X(98)00082-1_BIB5","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/0012-365X(77)90131-5","article-title":"Generating all graph coverings by permutation voltage assignments","volume":"18","author":"Gross","year":"1977","journal-title":"Disc. Math."},{"key":"10.1016\/S0166-218X(98)00082-1_BIB6","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/0012-365X(94)00324-C","article-title":"Some remarks on domination in cubic graphs","volume":"158","author":"Zelinka","year":"1996","journal-title":"Disc. Math."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X98000821?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X98000821?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T23:27:40Z","timestamp":1556666860000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X98000821"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,1]]},"references-count":6,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1999,1]]}},"alternative-id":["S0166218X98000821"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(98)00082-1","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1999,1]]}}}