{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,5,23]],"date-time":"2023-05-23T04:36:31Z","timestamp":1684816591818},"reference-count":23,"publisher":"World Scientific Pub Co Pte Lt","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2016,12]]},"abstract":"<jats:p> The [Formula: see text]-power domination number, [Formula: see text], of a graph [Formula: see text] is the minimum cardinality of a [Formula: see text]-power dominating set of [Formula: see text]. In this paper, we initiate the study of the [Formula: see text]-power bondage number, [Formula: see text], of a graph [Formula: see text], i.e., the minimum cardinality among all sets [Formula: see text] for which [Formula: see text]. We obtain a sharp upper bound for [Formula: see text] in terms of the degree of [Formula: see text]. We prove that [Formula: see text] for any nonempty tree [Formula: see text] and also provide some conditions on [Formula: see text] for [Formula: see text]. <\/jats:p>","DOI":"10.1142\/s1793830916500646","type":"journal-article","created":{"date-parts":[[2016,8,23]],"date-time":"2016-08-23T07:12:28Z","timestamp":1471936348000},"page":"1650064","source":"Crossref","is-referenced-by-count":1,"title":["The k-power bondage number of a graph"],"prefix":"10.1142","volume":"08","author":[{"given":"Seethu","family":"Varghese","sequence":"first","affiliation":[{"name":"Department of Mathematics, Cochin University of Science and Technology, Cochin-682022, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Vijayakumar","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Cochin University of Science and Technology, Cochin-682022, India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2016,11,8]]},"reference":[{"key":"S1793830916500646BIB001","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-008-9176-7"},{"key":"S1793830916500646BIB002","doi-asserted-by":"publisher","DOI":"10.1109\/59.260810"},{"key":"S1793830916500646BIB003","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(83)90085-7"},{"key":"S1793830916500646BIB004","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2012.03.007"},{"key":"S1793830916500646BIB005","doi-asserted-by":"publisher","DOI":"10.1137\/120891356"},{"key":"S1793830916500646BIB006","doi-asserted-by":"publisher","DOI":"10.1007\/s10440-014-9870-7"},{"key":"S1793830916500646BIB007","doi-asserted-by":"publisher","DOI":"10.1137\/060661879"},{"issue":"3","key":"S1793830916500646BIB008","first-page":"#5","volume":"18","author":"Dorbec P.","year":"2016","journal-title":"Discrete Math. Theor. Comput. Sci."},{"key":"S1793830916500646BIB009","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2005.08.006"},{"key":"S1793830916500646BIB010","doi-asserted-by":"publisher","DOI":"10.1080\/09720529.2011.10698353"},{"key":"S1793830916500646BIB011","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(90)90348-L"},{"key":"S1793830916500646BIB012","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-007-9147-x"},{"key":"S1793830916500646BIB013","first-page":"31","volume":"22","author":"Hartnell B. L.","year":"1998","journal-title":"Bull. Inst. Combin. Appl."},{"key":"S1793830916500646BIB014","first-page":"65","volume":"33","author":"Hartnell B. L.","year":"1992","journal-title":"Ars Combin."},{"key":"S1793830916500646BIB015","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(94)90111-2"},{"key":"S1793830916500646BIB016","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480100375831"},{"key":"S1793830916500646BIB017","volume-title":"Fundamentals of Domination in Graphs","author":"Haynes T. W.","year":"1998"},{"key":"S1793830916500646BIB018","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(99)00405-7"},{"key":"S1793830916500646BIB019","first-page":"227","volume-title":"Advances in Graph Theory","author":"Kulli V. R.","year":"1991"},{"key":"S1793830916500646BIB020","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2007.10.010"},{"key":"S1793830916500646BIB022","first-page":"70","volume":"2","author":"Walikar H. B.","year":"1979","journal-title":"Nat. Acad. Sci. Lett."},{"key":"S1793830916500646BIB023","first-page":"34","volume":"2013","author":"Xu J. M.","year":"2013","journal-title":"Int. J. Comb."},{"key":"S1793830916500646BIB024","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2006.03.037"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830916500646","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T18:08:34Z","timestamp":1565201314000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830916500646"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,11,8]]},"references-count":23,"journal-issue":{"issue":"04","published-online":{"date-parts":[[2016,11,8]]},"published-print":{"date-parts":[[2016,12]]}},"alternative-id":["10.1142\/S1793830916500646"],"URL":"https:\/\/doi.org\/10.1142\/s1793830916500646","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,11,8]]}}}