{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,16]],"date-time":"2024-09-16T20:02:07Z","timestamp":1726516927020},"reference-count":8,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1997,4,1]],"date-time":"1997-04-01T00:00:00Z","timestamp":859852800000},"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":5951,"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":[[1997,4]]},"DOI":"10.1016\/s0012-365x(97)00232-x","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T19:07:02Z","timestamp":1027624022000},"page":"249-259","source":"Crossref","is-referenced-by-count":13,"special_numbering":"C","title":["The bondage and reinforcement numbers of \u03b3f for some graphs"],"prefix":"10.1016","volume":"167-168","author":[{"given":"Gayla S.","family":"Domke","sequence":"first","affiliation":[]},{"given":"Renu C.","family":"Laskar","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(97)00232-X_BIB1","first-page":"70","article-title":"Domination critical graphs","volume":"2","author":"Acharya","year":"1979","journal-title":"Nat. Acad. Sci. Lett."},{"key":"10.1016\/S0012-365X(97)00232-X_BIB2","first-page":"227","article-title":"Fractional packings, coverings and irredundance in graphs","volume":"66","author":"Domke","year":"1988"},{"key":"10.1016\/S0012-365X(97)00232-X_BIB3","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/0166-218X(84)90061-1","article-title":"Domination, independent domination and duality in strongly chordal graphs","volume":"7","author":"Farber","year":"1986","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0012-365X(97)00232-X_BIB4","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0012-365X(90)90348-L","article-title":"The bondage number of a graph","volume":"86","author":"Fink","year":"1990","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(97)00232-X_BIB5","unstructured":"J. Ghoshal, R. Laskar, D. Pillone and C. Wallis, Strong bondage and strong reinforcement numbers of graphs, preprint."},{"article-title":"Linear time resource allocation algorithms for trees","year":"1987","author":"Hedetniemi","key":"10.1016\/S0012-365X(97)00232-X_BIB6"},{"key":"10.1016\/S0012-365X(97)00232-X_BIB7","first-page":"225","article-title":"Reinforcement in graphs","volume":"79","author":"Kok","year":"1990"},{"key":"10.1016\/S0012-365X(97)00232-X_BIB8","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0095-8956(83)90007-2","article-title":"Domination critical graphs","volume":"34","author":"Sumner","year":"1983","journal-title":"J. Combin. Theory Ser. B"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X9700232X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X9700232X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T01:26:43Z","timestamp":1555982803000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X9700232X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,4]]},"references-count":8,"alternative-id":["S0012365X9700232X"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(97)00232-x","relation":{},"ISSN":["0012-365X"],"issn-type":[{"type":"print","value":"0012-365X"}],"subject":[],"published":{"date-parts":[[1997,4]]}}}