{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T21:02:34Z","timestamp":1772744554136,"version":"3.50.1"},"reference-count":7,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1999,5,1]],"date-time":"1999-05-01T00:00:00Z","timestamp":925516800000},"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":5191,"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":[[1999,5]]},"DOI":"10.1016\/s0012-365x(99)00016-3","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T17:35:45Z","timestamp":1027618545000},"page":"61-69","source":"Crossref","is-referenced-by-count":96,"title":["Restrained domination in graphs"],"prefix":"10.1016","volume":"203","author":[{"given":"Gayla S.","family":"Domke","sequence":"first","affiliation":[]},{"given":"Johannes H.","family":"Hattingh","sequence":"additional","affiliation":[]},{"given":"Stephen T.","family":"Hedetniemi","sequence":"additional","affiliation":[]},{"given":"Renu C.","family":"Laskar","sequence":"additional","affiliation":[]},{"given":"Lisa R.","family":"Markus","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(99)00016-3_BIB1","unstructured":"G. Chartrand, L. Lesniak, Graphs and Digraphs, Second ed., Wadsworth and Brooks\/Cole, Monterey, CA, 1986."},{"key":"10.1016\/S0012-365X(99)00016-3_BIB2","unstructured":"M.R. Garey, D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, New York, 1979."},{"key":"10.1016\/S0012-365X(99)00016-3_BIB3","first-page":"728","article-title":"Relations du type Nordhaus-Gaddum pour le nombre d'absorption d'un graphe simple","volume":"274","author":"Jaeger","year":"1972","journal-title":"C. R. Acad. Sci. Ser. A"},{"key":"10.1016\/S0012-365X(99)00016-3_BIB4","unstructured":"J.P. Joseph, S. Arumugam, A note on domination in graphs, Preprint."},{"key":"10.1016\/S0012-365X(99)00016-3_BIB5","doi-asserted-by":"crossref","first-page":"175","DOI":"10.2307\/2306658","article-title":"On complementary graphs","volume":"63","author":"Nordhaus","year":"1956","journal-title":"Amer. Math. Monthly"},{"key":"10.1016\/S0012-365X(99)00016-3_BIB6","unstructured":"J.A. Telle, Vertex partitioning problems: characterization, complexity and algorithms on partial k-trees, Ph.D. Thesis, University of Oregon, CIS-TR-94-18."},{"key":"10.1016\/S0012-365X(99)00016-3_BIB7","unstructured":"T.V. Wimer, Linear algorithms on k-terminal graphs, Ph.D. Thesis, Clemson University, 1987."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X99000163?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X99000163?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T18:24:59Z","timestamp":1556130299000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X99000163"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,5]]},"references-count":7,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1999,5]]}},"alternative-id":["S0012365X99000163"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(99)00016-3","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1999,5]]}}}