{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,17]],"date-time":"2026-01-17T01:07:24Z","timestamp":1768612044830,"version":"3.49.0"},"reference-count":11,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2003,3,1]],"date-time":"2003-03-01T00:00:00Z","timestamp":1046476800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3827,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2003,3]]},"DOI":"10.1016\/s0304-3975(02)00434-6","type":"journal-article","created":{"date-parts":[[2003,2,12]],"date-time":"2003-02-12T12:35:20Z","timestamp":1045053320000},"page":"89-98","source":"Crossref","is-referenced-by-count":14,"title":["Lower bounds on the minus domination and k-subdomination numbers"],"prefix":"10.1016","volume":"296","author":[{"given":"Liying","family":"Kang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hong","family":"Qiao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Erfang","family":"Shan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dingzhu","family":"Du","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(02)00434-6_BIB1","first-page":"235","article-title":"On a generalization of signed dominating function of graphs","volume":"43","author":"Cockayne","year":"1996","journal-title":"Ars Combin."},{"key":"10.1016\/S0304-3975(02)00434-6_BIB2","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0166-218X(95)00056-W","article-title":"The algorithm complexity of minus domination in graphs","volume":"68","author":"Dunbar","year":"1996","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0304-3975(02)00434-6_BIB3","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/S0012-365X(98)00284-2","article-title":"Minus domination in graphs","volume":"199","author":"Dunbar","year":"1999","journal-title":"Discrete Math."},{"key":"10.1016\/S0304-3975(02)00434-6_BIB4","series-title":"Graph Theory, Combinatorics, and Applications","first-page":"311","article-title":"Signed domination in graphs","author":"Dunbar","year":"1995"},{"key":"10.1016\/S0304-3975(02)00434-6_BIB5","series-title":"Domination in Graphs","year":"1998"},{"key":"10.1016\/S0304-3975(02)00434-6_BIB6","series-title":"Fundamenters of Domination in Graphs","author":"Hedetniemi","year":"1998"},{"key":"10.1016\/S0304-3975(02)00434-6_BIB7","first-page":"263","article-title":"Domination in regular graphs","volume":"43","author":"Henning","year":"1996","journal-title":"Ars Combin."},{"key":"10.1016\/S0304-3975(02)00434-6_BIB8","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1002\/(SICI)1097-0118(199805)28:1<49::AID-JGT6>3.0.CO;2-F","article-title":"Strict majority functions on graphs","volume":"28","author":"Henning","year":"1998","journal-title":"J. Graph Theorem"},{"key":"10.1016\/S0304-3975(02)00434-6_BIB9","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0012-365X(96)00025-8","article-title":"Inequality relation domination parameters in cube graphs","volume":"158","author":"Henning","year":"1996","journal-title":"Discrete Math."},{"key":"10.1016\/S0304-3975(02)00434-6_BIB10","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/S0012-365X(01)00311-9","article-title":"Upper bounds for k-subdomination number of graphs","volume":"247","author":"Kang Liying","year":"2002","journal-title":"Discrete Math."},{"key":"10.1016\/S0304-3975(02)00434-6_BIB11","first-page":"121","article-title":"Lower bounds on dominating functions in graphs","volume":"56","author":"Liying","year":"2000","journal-title":"Ars Combin."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502004346?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502004346?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,27]],"date-time":"2019-03-27T10:29:19Z","timestamp":1553682559000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397502004346"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,3]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,3]]}},"alternative-id":["S0304397502004346"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(02)00434-6","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2003,3]]}}}