{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,23]],"date-time":"2026-02-23T20:49:11Z","timestamp":1771879751013,"version":"3.50.1"},"reference-count":6,"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(98)00029-6","type":"journal-article","created":{"date-parts":[[2003,5,19]],"date-time":"2003-05-19T12:52:26Z","timestamp":1053348746000},"page":"253-260","source":"Crossref","is-referenced-by-count":7,"title":["Irredundant and perfect neighbourhood sets in trees"],"prefix":"10.1016","volume":"188","author":[{"given":"E.J.","family":"Cockayne","sequence":"first","affiliation":[]},{"given":"S.M.","family":"Hedetniemi","sequence":"additional","affiliation":[]},{"given":"S.T.","family":"Hedetniemi","sequence":"additional","affiliation":[]},{"given":"C.M.","family":"Mynhardt","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(98)00029-6_BIB1","unstructured":"E.J. Cockayne, Bibliography concerning basic irredundant sets and the parameters ir(G) and IR(G), unpublished."},{"key":"10.1016\/S0012-365X(98)00029-6_BIB2","first-page":"213","article-title":"What makes an irredundant set maximal?","volume":"25","author":"Cockayne","year":"1997","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"10.1016\/S0012-365X(98)00029-6_BIB3","unstructured":"G.H. Fricke, T.W. Haynes, S.M. Hedetniemi, S.T. Hedetniemi and M.A. Henning, Perfect neighborhoods in graphs, submitted."},{"key":"10.1016\/S0012-365X(98)00029-6_BIB4","unstructured":"T.W. Haynes, S.T. Hedetniemi, Bibiography on dominating sets in graphs, private communication."},{"key":"10.1016\/S0012-365X(98)00029-6_BIB5","unstructured":"S.T. Hedetniemi, D.P. Jacobs, R. Laskar, D. Pillone, Open perfect neighborhood sets in graphs, submitted."},{"key":"10.1016\/S0012-365X(98)00029-6_BIB6","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/0012-365X(90)90365-O","article-title":"Bibliography on domination and some basic definitions of domination parameters","volume":"86","author":"Hedetniemi","year":"1990","journal-title":"Discrete Math."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X98000296?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X98000296?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:48Z","timestamp":1556155248000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X98000296"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,6]]},"references-count":6,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1998,6]]}},"alternative-id":["S0012365X98000296"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(98)00029-6","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1998,6]]}}}