{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T15:05:27Z","timestamp":1777993527988,"version":"3.51.4"},"reference-count":6,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1978,1,1]],"date-time":"1978-01-01T00:00:00Z","timestamp":252460800000},"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":12981,"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":[[1978]]},"DOI":"10.1016\/0012-365x(78)90105-x","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:33:13Z","timestamp":1027654393000},"page":"73-76","source":"Crossref","is-referenced-by-count":137,"title":["On domination and independent domination numbers of a graph"],"prefix":"10.1016","volume":"23","author":[{"given":"Robert B.","family":"Allan","sequence":"first","affiliation":[]},{"given":"Renu","family":"Laskar","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(78)90105-X_BIB1","first-page":"309","article-title":"Graphs and Hypergraphs","author":"Berge","year":"1973"},{"key":"10.1016\/0012-365X(78)90105-X_BIB2","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1002\/net.3230070305","article-title":"Towards a theory of domination in graphs","author":"Cockayne","year":"1977","journal-title":"Networks Fall"},{"key":"10.1016\/0012-365X(78)90105-X_BIB3","series-title":"Graph Theory","author":"Harary","year":"1969"},{"key":"10.1016\/0012-365X(78)90105-X_BIB4","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/0012-365X(76)90037-6","article-title":"Traversability and connectivity of the middle graph of a graph","volume":"14","author":"Hamada","year":"1976","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(78)90105-X_BIB5","article-title":"Independent domination in Trees","author":"Hedetniemi","year":"1977","journal-title":"Proc. Eighth S.E. Conf. on Combinatorics, Graph Theory, and Computing"},{"key":"10.1016\/0012-365X(78)90105-X_BIB6","first-page":"206","article-title":"Theory of Graphs","volume":"Vol. XXXVIII","author":"Ore","year":"1962"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X7890105X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X7890105X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T11:21:37Z","timestamp":1555154497000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X7890105X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1978]]},"references-count":6,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1978]]}},"alternative-id":["0012365X7890105X"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(78)90105-x","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1978]]}}}