{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T13:14:39Z","timestamp":1649164479353},"reference-count":3,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1998,6,1]],"date-time":"1998-06-01T00:00:00Z","timestamp":896659200000},"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":5525,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1998,6]]},"DOI":"10.1016\/s0012-365x(97)00267-7","type":"journal-article","created":{"date-parts":[[2003,5,19]],"date-time":"2003-05-19T12:52:26Z","timestamp":1053348746000},"page":"261-266","source":"Crossref","is-referenced-by-count":4,"title":["On the independent domination number of graphs with given minimum degree"],"prefix":"10.1016","volume":"188","author":[{"given":"N.I.","family":"Glebov","sequence":"first","affiliation":[]},{"given":"A.V.","family":"Kostochka","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(97)00267-7_BIB1","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1002\/jgt.3190030306","article-title":"Graph theoretic parameters concerning domination, independence and irredundance","volume":"3","author":"Bollob\u00e1s","year":"1979","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(97)00267-7_BIB2","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/0012-365X(88)90076-3","article-title":"Two relations between the parameters of independence and irredundance","volume":"70","author":"Favaron","year":"1988","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(97)00267-7_BIB3","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0012-365X(91)90318-V","article-title":"On minimum maximal independent sets of a graph","volume":"94","author":"Haviland","year":"1991","journal-title":"Discrete Math."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X97002677?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X97002677?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,25]],"date-time":"2019-04-25T01:20:47Z","timestamp":1556155247000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X97002677"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,6]]},"references-count":3,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1998,6]]}},"alternative-id":["S0012365X97002677"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(97)00267-7","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1998,6]]}}}