{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T09:45:36Z","timestamp":1777974336906,"version":"3.51.4"},"reference-count":11,"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)00242-2","type":"journal-article","created":{"date-parts":[[2003,4,30]],"date-time":"2003-04-30T22:23:46Z","timestamp":1051741426000},"page":"1-17","source":"Crossref","is-referenced-by-count":15,"title":["Parity dimension for graphs"],"prefix":"10.1016","volume":"187","author":[{"given":"Ashok T.","family":"Amin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lane H.","family":"Clark","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter J.","family":"Slater","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(97)00242-2_bib1","first-page":"19","article-title":"Neighborhood domination with parity restrictions in graphs","volume":"91","author":"Amin","year":"1992"},{"key":"10.1016\/S0012-365X(97)00242-2_bib2","first-page":"53","article-title":"All parity realizable trees","volume":"20","author":"Amin","year":"1996","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"10.1016\/S0012-365X(97)00242-2_bib3","series-title":"Applications of Discrete Mathematics","first-page":"189","article-title":"Efficient dominating sets in graphs","author":"Bange","year":"1988"},{"key":"10.1016\/S0012-365X(97)00242-2_bib4","first-page":"133","article-title":"Enumeration of labeled multipartite multigraphs by degree parities","volume":"108","author":"Clark","year":"1995"},{"key":"10.1016\/S0012-365X(97)00242-2_bib5","volume":"86","year":"1990"},{"key":"10.1016\/S0012-365X(97)00242-2_bib6","series-title":"18th Manitoba Conf. on Numerical Mathematics and Computing","article-title":"Complexity questions for n-domination and related parameters","author":"Jacobson","year":"1988"},{"key":"10.1016\/S0012-365X(97)00242-2_bib7","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/0196-6774(80)90012-7","article-title":"A linear algorithm for a core of a tree","volume":"1","author":"Morgan","year":"1980","journal-title":"J. Algorithms"},{"key":"10.1016\/S0012-365X(97)00242-2_bib8","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0012-365X(82)90058-9","article-title":"Enumeration of labeled multigraphs by degree parities","volume":"42","author":"Read","year":"1982","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(97)00242-2_bib9","series-title":"The Theory and Applications of Graphs","first-page":"529","article-title":"Centrality of paths and vertices in a graph: cores and pits","author":"Slater","year":"1981"},{"key":"10.1016\/S0012-365X(97)00242-2_bib10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/trsc.16.1.1","article-title":"Locating central paths in a graph","volume":"16","author":"Slater","year":"1982","journal-title":"Transportation Sci."},{"key":"10.1016\/S0012-365X(97)00242-2_bib11","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/BF03023823","article-title":"Linear cellular automata and the Garden-of-Eden","volume":"11","author":"Sutner","year":"1989","journal-title":"Math. Intelligencer"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X97002422?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X97002422?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,26]],"date-time":"2019-04-26T03:29:20Z","timestamp":1556249360000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X97002422"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,6]]},"references-count":11,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1998,6]]}},"alternative-id":["S0012365X97002422"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(97)00242-2","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1998,6]]}}}