{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T11:45:15Z","timestamp":1772019915476,"version":"3.50.1"},"reference-count":11,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1999,2,1]],"date-time":"1999-02-01T00:00:00Z","timestamp":917827200000},"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":5280,"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":[[1999,2]]},"DOI":"10.1016\/s0012-365x(99)90093-6","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T20:16:34Z","timestamp":1051128994000},"page":"409-413","source":"Crossref","is-referenced-by-count":5,"special_numbering":"C","title":["A bound on the size of a graph with given order and bondage number"],"prefix":"10.1016","volume":"197-198","author":[{"given":"Bert L.","family":"Hartnell","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Douglas F.","family":"Rall","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(99)90093-6_BIB1","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/0012-365X(83)90085-7","article-title":"Domination alteration sets in graphs","volume":"47","author":"Bauer","year":"1983","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(99)90093-6_BIB2","series-title":"Theory of Graphs","first-page":"61","article-title":"Graphs with prescribed connectivities","author":"Chartrand","year":"1968"},{"key":"10.1016\/S0012-365X(99)90093-6_BIB3","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0012-365X(90)90360-T","article-title":"The discipline number of a graph","volume":"86","author":"Chv\u00e1tal","year":"1990","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(99)90093-6_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(99)90093-6_BIB5","first-page":"31","article-title":"Edge stability of the k-domination number of trees","volume":"22","author":"Hartnell","year":"1998","journal-title":"Bull. ICA"},{"key":"10.1016\/S0012-365X(99)90093-6_BIB6","first-page":"65","article-title":"A characterization of trees in which no edge is essential to the domination number","volume":"33","author":"Hartnell","year":"1992","journal-title":"Ars Combin."},{"key":"10.1016\/S0012-365X(99)90093-6_BIB7","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0012-365X(94)90111-2","article-title":"Bounds on the bondage number of a graph","volume":"128","author":"Hartnell","year":"1994","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(99)90093-6_BIB8","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1016\/0012-365X(93)90317-M","article-title":"A counterexample to a conjecture on the bondage number of a graph","volume":"122","author":"Teschner","year":"1993","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(99)90093-6_BIB9","first-page":"27","article-title":"A new upper bound for the bondage number of graphs with small domination number","volume":"12","author":"Teschner","year":"1995","journal-title":"Australas. J. Combin."},{"key":"10.1016\/S0012-365X(99)90093-6_BIB10","first-page":"81","article-title":"The bondage number of a graph G can be much greater than \u0394(G)","volume":"43","author":"Teschner","year":"1996","journal-title":"Ars Combin."},{"key":"10.1016\/S0012-365X(99)90093-6_BIB11","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/0012-365X(96)00347-0","article-title":"On the bondage number of a graph","volume":"159","author":"Wang","year":"1996","journal-title":"Discrete Math."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X99900936?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X99900936?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,22]],"date-time":"2019-03-22T04:22:00Z","timestamp":1553228520000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X99900936"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,2]]},"references-count":11,"alternative-id":["S0012365X99900936"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(99)90093-6","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1999,2]]}}}