{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,6,26]],"date-time":"2023-06-26T06:10:17Z","timestamp":1687759817236},"reference-count":11,"publisher":"World Scientific Pub Co Pte Ltd","issue":"03","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2012,9]]},"abstract":"<jats:p>The bondage number b(G) of a nonempty graph G is the cardinality of a smallest set of edges whose removal from G results in a graph with domination number greater than \u03b3(G), where \u03b3(G) denote the domination number of G. Let G be a toroidal graph with maximum degree \u0394(G). In this paper, we show that b(G) \u2264 9. Moveover, if \u0394(G) \u2260 6, then b(G) \u2264 8.<\/jats:p>","DOI":"10.1142\/s1793830912500462","type":"journal-article","created":{"date-parts":[[2012,8,6]],"date-time":"2012-08-06T08:31:23Z","timestamp":1344241883000},"page":"1250046","source":"Crossref","is-referenced-by-count":3,"title":["A BOUND ON THE BONDAGE NUMBER OF TOROIDAL GRAPHS"],"prefix":"10.1142","volume":"04","author":[{"given":"JIANFENG","family":"HOU","sequence":"first","affiliation":[{"name":"Center for Discrete Mathematics, Fuzhou University, Fujian 350002, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"GUIZHEN","family":"LIU","sequence":"additional","affiliation":[{"name":"School of Mathematics, Shandong University, Jinan 250100, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2012,8,6]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(83)90085-7"},{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2006.02.008"},{"key":"rf3","volume-title":"Domination in Graphs: Advanced Topics","author":"Dunbar J. E.","year":"1998"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(90)90348-L"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(02)00449-1"},{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.1007\/BF01844162"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(94)90111-2"},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(99)00405-7"},{"key":"rf9","doi-asserted-by":"crossref","DOI":"10.56021\/9780801866890","volume-title":"Graphs on Surfaces","author":"Mohar B.","year":"2001"},{"key":"rf10","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(93)90317-M"},{"key":"rf11","first-page":"27","volume":"12","author":"Teschner U.","journal-title":"Australas. J. Combin."}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830912500462","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,25]],"date-time":"2023-06-25T05:26:14Z","timestamp":1687670774000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830912500462"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,8,6]]},"references-count":11,"journal-issue":{"issue":"03","published-online":{"date-parts":[[2012,8,6]]},"published-print":{"date-parts":[[2012,9]]}},"alternative-id":["10.1142\/S1793830912500462"],"URL":"https:\/\/doi.org\/10.1142\/s1793830912500462","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,8,6]]}}}