{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:30:12Z","timestamp":1759638612065,"version":"3.40.3"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319266251"},{"type":"electronic","value":"9783319266268"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-26626-8_48","type":"book-chapter","created":{"date-parts":[[2015,12,9]],"date-time":"2015-12-09T04:08:43Z","timestamp":1449634123000},"page":"660-675","source":"Crossref","is-referenced-by-count":2,"title":["The Disjunctive Bondage Number and the Disjunctive Total Bondage Number of Graphs"],"prefix":"10.1007","author":[{"given":"Eunjeong","family":"Yi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,12,9]]},"reference":[{"key":"48_CR1","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/0012-365X(83)90085-7","volume":"47","author":"D Bauer","year":"1983","unstructured":"Bauer, D., Harary, F., Nieminen, J., Suffel, C.L.: Domination alteration sets in graphs. Discrete Math. 47, 153\u2013161 (1983)","journal-title":"Discrete Math."},{"key":"48_CR2","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0012-365X(90)90348-L","volume":"86","author":"JF Fink","year":"1990","unstructured":"Fink, J.F., Jacobson, M.S., Kinch, L.F., Roberts, J.: The bondage number of a graph. Discrete Math. 86, 47\u201357 (1990)","journal-title":"Discrete Math."},{"key":"48_CR3","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York (1979)"},{"issue":"4","key":"48_CR4","doi-asserted-by":"publisher","first-page":"547","DOI":"10.2989\/16073606.2014.894688","volume":"37","author":"W Goddard","year":"2014","unstructured":"Goddard, W., Henning, M.A., McPillan, C.A.: The disjunctive domination number of a graph. Quaest. Math. 37(4), 547\u2013561 (2014)","journal-title":"Quaest. Math."},{"key":"48_CR5","volume-title":"Fundamentals of Domination in Graphs","author":"TW Haynes","year":"1998","unstructured":"Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Fundamentals of Domination in Graphs. Marcel Dekker, New York (1998)"},{"key":"48_CR6","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/j.disc.2007.12.044","volume":"309","author":"MA Henning","year":"2009","unstructured":"Henning, M.A.: A survey of selected recent results on total domination in graphs. Discrete Math. 309, 32\u201363 (2009)","journal-title":"Discrete Math."},{"key":"48_CR7","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/j.dam.2014.10.036","volume":"184","author":"MA Henning","year":"2015","unstructured":"Henning, M.A., Marcon, S.A.: Domination versus disjunctive domination in trees. Discrete Appl. Math. 184, 171\u2013177 (2015)","journal-title":"Discrete Appl. Math."},{"key":"48_CR8","doi-asserted-by":"crossref","unstructured":"Henning, M.A., Naicker, V.: Disjunctive total domination in graphs. J. Comb. Optim. DOI: 10.1007\/s10878-014-9811-4","DOI":"10.1007\/s10878-014-9811-4"},{"issue":"2","key":"48_CR9","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1016\/j.jco.2011.11.001","volume":"28","author":"FT Hu","year":"2012","unstructured":"Hu, F.T., Xu, J.M.: Complexity of bondage and reinforcement. J. Complex. 28(2), 192\u2013201 (2012)","journal-title":"J. Complex."},{"key":"48_CR10","unstructured":"Kulli, V.R., Patwari, D.K.: The total bondage number of a graph. In: Kulli, V.R. (ed.) Advances in Graph Theory, pp 227\u2013235. Vishwa, Gulbarga (1991)"},{"key":"48_CR11","first-page":"13","volume":"2013","author":"JM Xu","year":"2013","unstructured":"Xu, J.M.: On bondage numbers of graphs: a survey with some comments. Int. J. Comb. 2013, 13 (2013). Article ID: 595210","journal-title":"Int. J. Comb."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-26626-8_48","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T17:16:57Z","timestamp":1559323017000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-26626-8_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319266251","9783319266268"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-26626-8_48","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}