{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:45:09Z","timestamp":1759063509912},"reference-count":21,"publisher":"World Scientific Pub Co Pte Lt","issue":"01","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2016,3]]},"abstract":"<jats:p> The bondage number [Formula: see text] of a graph [Formula: see text] is the cardinality of a minimum edge set whose removal from [Formula: see text] results in a graph with the domination number greater than that of [Formula: see text]. It is a parameter to measure the vulnerability of a communication network under link failure. In this paper, we obtain the exact value of the bondage number of the strong product of a complete graph and a path. That is, for any two integers [Formula: see text] and [Formula: see text], [Formula: see text] if [Formula: see text]; [Formula: see text] if [Formula: see text] (mod 3); [Formula: see text] if [Formula: see text] (mod 3). Furthermore, we determine the exact value of the bondage number of the strong product of a complete graph and a special starlike tree. <\/jats:p>","DOI":"10.1142\/s1793830916500063","type":"journal-article","created":{"date-parts":[[2015,12,29]],"date-time":"2015-12-29T03:53:56Z","timestamp":1451361236000},"page":"1650006","source":"Crossref","is-referenced-by-count":4,"title":["The bondage number of the strong product of a complete graph with a path and a special starlike tree"],"prefix":"10.1142","volume":"08","author":[{"given":"Weisheng","family":"Zhao","sequence":"first","affiliation":[{"name":"School of Mathematics and Statistics, Lanzhou University, Lanzhou, Gansu 730000, P. R. China"},{"name":"Institute for Interdisciplinary Research, Jianghan University, Wuhan, Hubei 430056, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Heping","family":"Zhang","sequence":"additional","affiliation":[{"name":"School of Mathematics and Statistics, Lanzhou University, Lanzhou, Gansu 730000, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2016,2,26]]},"reference":[{"key":"S1793830916500063BIB001","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(83)90085-7"},{"key":"S1793830916500063BIB002","first-page":"299","volume":"97","author":"Cao J. X.","year":"2010","journal-title":"Ars. Combin."},{"key":"S1793830916500063BIB003","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2013.11.020"},{"key":"S1793830916500063BIB004","first-page":"471","volume-title":"Domination in Graphs Advanced Topics","author":"Dunbar J. E.","year":"1998"},{"key":"S1793830916500063BIB005","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(90)90348-L"},{"key":"S1793830916500063BIB006","doi-asserted-by":"crossref","DOI":"10.1201\/b10959","volume-title":"Handbook of Product Graphs","author":"Hammack R.","year":"2011"},{"key":"S1793830916500063BIB007","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(94)90111-2"},{"key":"S1793830916500063BIB008","first-page":"31","volume":"22","author":"Hartnell B. L.","year":"1998","journal-title":"Bull. Inst. Combin. Appl."},{"key":"S1793830916500063BIB009","doi-asserted-by":"publisher","DOI":"10.1016\/j.jco.2011.11.001"},{"key":"S1793830916500063BIB010","doi-asserted-by":"publisher","DOI":"10.1007\/s11464-012-0173-x"},{"key":"S1793830916500063BIB011","doi-asserted-by":"publisher","DOI":"10.1016\/j.camwa.2005.10.015"},{"key":"S1793830916500063BIB012","first-page":"33","volume":"18","author":"Jacobson M. S.","year":"1983","journal-title":"Ars. Combin."},{"key":"S1793830916500063BIB013","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2004.12.019"},{"key":"S1793830916500063BIB014","doi-asserted-by":"publisher","DOI":"10.2140\/pjm.1975.61.225"},{"key":"S1793830916500063BIB015","doi-asserted-by":"publisher","DOI":"10.7151\/dmgt.1023"},{"key":"S1793830916500063BIB016","doi-asserted-by":"publisher","DOI":"10.4134\/JKMS.2007.44.6.1213"},{"key":"S1793830916500063BIB017","first-page":"81","volume":"43","author":"Teschner U.","year":"1996","journal-title":"Ars. Combin."},{"key":"S1793830916500063BIB018","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(96)00007-6"},{"key":"S1793830916500063BIB019","first-page":"34","volume":"2013","author":"Xu J. M.","year":"2013","journal-title":"Int. J. Comb."},{"key":"S1793830916500063BIB020","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2009.06.002"},{"key":"S1793830916500063BIB021","doi-asserted-by":"publisher","DOI":"10.1007\/s11464-014-0391-5"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830916500063","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T20:02:05Z","timestamp":1565121725000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830916500063"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,2,26]]},"references-count":21,"journal-issue":{"issue":"01","published-online":{"date-parts":[[2016,2,26]]},"published-print":{"date-parts":[[2016,3]]}},"alternative-id":["10.1142\/S1793830916500063"],"URL":"https:\/\/doi.org\/10.1142\/s1793830916500063","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,2,26]]}}}