{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,5,15]],"date-time":"2022-05-15T19:47:54Z","timestamp":1652644074972},"reference-count":7,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1995,6,1]],"date-time":"1995-06-01T00:00:00Z","timestamp":801964800000},"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":6621,"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":[[1995,6]]},"DOI":"10.1016\/0012-365x(93)e0143-r","type":"journal-article","created":{"date-parts":[[2003,4,30]],"date-time":"2003-04-30T22:23:46Z","timestamp":1051741426000},"page":"287-290","source":"Crossref","is-referenced-by-count":3,"title":["Universal minimal total dominating functions of trees"],"prefix":"10.1016","volume":"140","author":[{"given":"Alan","family":"Stacey","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(93)E0143-R_BIB1","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/0012-365X(84)90145-6","article-title":"A note on total domination","volume":"49","author":"Allan","year":"1984","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(93)E0143-R_BIB2","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1002\/net.3230100304","article-title":"Total domination in graphs","volume":"10","author":"Cockayne","year":"1980","journal-title":"Networks"},{"key":"10.1016\/0012-365X(93)E0143-R_BIB3","unstructured":"E.J. Cockayne, G. Fricke, S.T. Hedetniemi and C.M. Mynhardt, Properties of minimal dominating functions of graphs, submitted."},{"key":"10.1016\/0012-365X(93)E0143-R_BIB4","first-page":"23","article-title":"A linear algorithm for universal minimal dominating functions in trees","volume":"10","author":"Cockayne","year":"1991","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"10.1016\/0012-365X(93)E0143-R_BIB5","unstructured":"E.J. Cockayne, C.M. Mynhardt and P. Yu, Total dominating functions in trees: minimality and convexity, submitted."},{"key":"10.1016\/0012-365X(93)E0143-R_BIB6","unstructured":"E.J. Cockayne, C.M. Mynhardt and P. Yu, Universal minimal total dominating functions in graphs, submitted."},{"key":"10.1016\/0012-365X(93)E0143-R_BIB7","article-title":"Linear time resource allocation algorithms for trees","author":"Hedetniemi","year":"1987"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X93E0143R?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X93E0143R?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,25]],"date-time":"2019-04-25T04:28:41Z","timestamp":1556166521000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X93E0143R"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,6]]},"references-count":7,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1995,6]]}},"alternative-id":["0012365X93E0143R"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(93)e0143-r","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1995,6]]}}}