{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T01:50:22Z","timestamp":1649123422913},"reference-count":6,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2002,8,1]],"date-time":"2002-08-01T00:00:00Z","timestamp":1028160000000},"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":4003,"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":[[2002,8]]},"DOI":"10.1016\/s0166-218x(01)00284-0","type":"journal-article","created":{"date-parts":[[2002,7,28]],"date-time":"2002-07-28T20:40:59Z","timestamp":1027888859000},"page":"97-107","source":"Crossref","is-referenced-by-count":2,"title":["Graphs having distance-n domination number half their order"],"prefix":"10.1016","volume":"120","author":[{"given":"Miranca","family":"Fischermann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lutz","family":"Volkmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(01)00284-0_BIB1","first-page":"89","article-title":"Domination from a distance","volume":"103","author":"Boland","year":"1994","journal-title":"Congr. Numer."},{"key":"10.1016\/S0166-218X(01)00284-0_BIB2","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/BF01848079","article-title":"On graphs having domination number half their order","volume":"16","author":"Fink","year":"1985","journal-title":"Period. Math. Hungar."},{"key":"10.1016\/S0166-218X(01)00284-0_BIB3","first-page":"231","article-title":"Graph-valued functions related to step graphs","volume":"7","author":"Harary","year":"1982","journal-title":"J. Combin. Inform. System Sci."},{"key":"10.1016\/S0166-218X(01)00284-0_BIB4","series-title":"Fundamentals of Domination in Graphs","author":"Haynes","year":"1998"},{"key":"10.1016\/S0166-218X(01)00284-0_BIB5","first-page":"206","article-title":"Theory of Graphs","volume":"38","author":"Ore","year":"1962","journal-title":"Amer. Math. Soc. Colloq. Publ."},{"key":"10.1016\/S0166-218X(01)00284-0_BIB6","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1002\/jgt.3190060104","article-title":"Domination-balanced graphs","volume":"6","author":"Payan","year":"1982","journal-title":"J. Graph Theory"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X01002840?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X01002840?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,11]],"date-time":"2019-04-11T07:24:10Z","timestamp":1554967450000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X01002840"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,8]]},"references-count":6,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2002,8]]}},"alternative-id":["S0166218X01002840"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(01)00284-0","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2002,8]]}}}