{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T19:34:19Z","timestamp":1776108859187,"version":"3.50.1"},"reference-count":6,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1996,12,1]],"date-time":"1996-12-01T00:00:00Z","timestamp":849398400000},"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":6072,"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":[[1996,12]]},"DOI":"10.1016\/0012-365x(95)00231-k","type":"journal-article","created":{"date-parts":[[2003,4,30]],"date-time":"2003-04-30T22:23:46Z","timestamp":1051741426000},"page":"235-242","source":"Crossref","is-referenced-by-count":44,"title":["Strong weak domination and domination balance in a graph"],"prefix":"10.1016","volume":"161","author":[{"given":"E.","family":"Sampathkumar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L.Pushpa","family":"Latha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(95)00231-K_BIB1","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0012-365X(78)90105-X","article-title":"On domination and independent domination numbers of a graph","volume":"23","author":"Allan","year":"1978","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(95)00231-K_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"},{"key":"10.1016\/0012-365X(95)00231-K_BIB3","unstructured":"J.H. Hattingh and R.C. Laskar, On weak domination in graphs, Manuscript."},{"key":"10.1016\/0012-365X(95)00231-K_BIB4","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/0012-365X(90)90365-O","article-title":"Bibliography on domination in graphs and some basic definitions of domination parameters","volume":"86","author":"Hedetniemi","year":"1990","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(95)00231-K_BIB5","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1093\/imamat\/14.2.183","article-title":"Two bounds for the domination number of a graph","volume":"14","author":"Nieminen","year":"1974","journal-title":"J. Inst. Math. Appl."},{"issue":"6","key":"10.1016\/0012-365X(95)00231-K_BIB6","first-page":"607","article-title":"The connected domination number of a graph","volume":"13","author":"Sampathkumar","year":"1979","journal-title":"J. Math. Phy. Sci."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9500231K?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9500231K?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:26:03Z","timestamp":1556130363000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X9500231K"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,12]]},"references-count":6,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1996,12]]}},"alternative-id":["0012365X9500231K"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(95)00231-k","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1996,12]]}}}