{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T12:25:09Z","timestamp":1649075109103},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2013,2,23]],"date-time":"2013-02-23T00:00:00Z","timestamp":1361577600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2015,2]]},"DOI":"10.1007\/s10878-013-9597-9","type":"journal-article","created":{"date-parts":[[2013,2,22]],"date-time":"2013-02-22T03:47:41Z","timestamp":1361504861000},"page":"389-405","source":"Crossref","is-referenced-by-count":1,"title":["On the $$p$$ -reinforcement and the complexity"],"prefix":"10.1007","volume":"29","author":[{"given":"You","family":"Lu","sequence":"first","affiliation":[]},{"given":"Fu-Tao","family":"Hu","sequence":"additional","affiliation":[]},{"given":"Jun-Ming","family":"Xu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,2,23]]},"reference":[{"key":"9597_CR1","first-page":"317","volume":"33","author":"M Blidia","year":"2005","unstructured":"Blidia M, Chellali M, Favaron O (2005) Independence and 2-domination in trees. Australas J Combin 33:317\u2013327","journal-title":"Australas J Combin"},{"key":"9597_CR2","doi-asserted-by":"crossref","first-page":"2031","DOI":"10.1016\/j.disc.2006.04.010","volume":"306","author":"M Blidia","year":"2006","unstructured":"Blidia M, Chellali M, Volkmann L (2006) Some bounds on the p-domination number in trees. Discret Math 306:2031\u20132037","journal-title":"Discret Math"},{"key":"9597_CR3","doi-asserted-by":"crossref","first-page":"1165","DOI":"10.1016\/j.disc.2007.03.067","volume":"308","author":"JRS Blair","year":"2008","unstructured":"Blair JRS, Goddard W, Hedetniemi ST, Horton S, Jones P, Kubicki G (2008) On domination and reinforcement numbers in trees. Discret Math 308:1165\u20131175","journal-title":"Discret Math"},{"key":"9597_CR4","doi-asserted-by":"crossref","unstructured":"Chellali M, Favaron O, Hansberg A, Volkmann L (2012) k-domination and k-independence in graphs: a survey. Graphs Combin. 28(1):1-55","DOI":"10.1007\/s00373-011-1040-3"},{"key":"9597_CR5","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1155\/S016117129000031X","volume":"13","author":"Y Caro","year":"1990","unstructured":"Caro Y, Roditty Y (1990) A note on the $$k$$ -domination number of a graph. Int J Math Sci 13:205\u2013206","journal-title":"Int J Math Sci"},{"key":"9597_CR6","unstructured":"Chen X, Sun L, Ma D (2003) Bondage and reinforcement number of $$\\gamma _f$$ for complete multipartite graph. J Beijing Inst Technol 12:89\u201391"},{"key":"9597_CR7","unstructured":"Dunbar JE, Haynes TW, Teschner U, Volkmann L (1998) Bondage, insensitivity, and reinforcement. In: Haynes TW, Hedetniemi ST, Slater PJ (eds) Domination in graphs: advanced topics, pp 471\u2013489. Monogr. Textbooks Pure Appl. Math., 209, Marcel Dekker, New York, ."},{"key":"9597_CR8","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/S0012-365X(97)00232-X","volume":"167\/168","author":"GS Domke","year":"1997","unstructured":"Domke GS, Laskar RC (1997) The bondage and reinforcement numbers of $$\\gamma _f$$ for some graphs. Discret Math 167\/168:249\u2013259","journal-title":"Discret Math"},{"key":"9597_CR9","doi-asserted-by":"crossref","unstructured":"Downey RG, Fellows MR (1995) Fixed-parameter tractability and completeness I: basic results. SIAM J Comput 24:873\u2013921","DOI":"10.1137\/S0097539792228228"},{"issue":"3","key":"9597_CR10","first-page":"465","volume":"54","author":"RG Downey","year":"1997","unstructured":"Downey RG, Fellows MR (1997) Fixed-parameter tractability and completeness II: on completeness for $$W[1]$$ . Theor Comput Sci 54(3):465\u2013474","journal-title":"Theor Comput Sci"},{"key":"9597_CR11","doi-asserted-by":"crossref","unstructured":"Favaron O (1985) On a conjecture of Fink and Jacobson concerning $$k$$ -domination and $$k$$ -dependence. J Combin Theory Ser B 39:101\u2013102","DOI":"10.1016\/0095-8956(85)90040-1"},{"key":"9597_CR12","first-page":"283","volume-title":"Graph theory with applications to algorithms and computer science","author":"JF Fink","year":"1985","unstructured":"Fink JF, Jacobson MS (1985) $$n$$ -domination in graphs. In: Alavi Y, Schwenk AJ (eds) Graph theory with applications to algorithms and computer science. Wiley, New York, pp 283\u2013300"},{"key":"9597_CR13","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. Freeman, San Francisco"},{"key":"9597_CR14","unstructured":"Haynes TW, Hedetniemi ST, Slater PJ (1998a) Fundamentals of domination in graphs. Marcel Deliker, New York"},{"key":"9597_CR15","volume-title":"Domination in graphs: advanced topics","author":"TW Haynes","year":"1998","unstructured":"Haynes TW, Hedetniemi ST, Slater PJ (1998b) Domination in graphs: advanced topics. Marcel Deliker, New York"},{"key":"9597_CR16","doi-asserted-by":"crossref","first-page":"1443","DOI":"10.1016\/j.dam.2011.04.024","volume":"159","author":"MA Henning","year":"2011","unstructured":"Henning MA, Rad NJ, Raczek J (2011) A note on total reinforcement in graph. Discret Appl Math 159:1443\u20131446","journal-title":"Discret Appl Math"},{"key":"9597_CR17","doi-asserted-by":"crossref","unstructured":"Hu F-T, Xu J-M (2012) On the complexity of the bondage and reinforcement problems. J Complex. 28(2): 192-201","DOI":"10.1016\/j.jco.2011.11.001"},{"key":"9597_CR18","doi-asserted-by":"crossref","first-page":"1938","DOI":"10.1016\/j.dam.2009.01.002","volume":"157","author":"J Huang","year":"2009","unstructured":"Huang J, Wang JW, Xu J-M (2009) Reinforcement number of digraphs. Discret Appl Math 157:1938\u20131946","journal-title":"Discret Appl Math"},{"key":"9597_CR19","first-page":"225","volume":"79","author":"J Kok","year":"1990","unstructured":"Kok J, Mynhardt CM (1990) Reinforcement in graphs. Congr Numer 79:225\u2013231","journal-title":"Congr Numer"},{"key":"9597_CR20","unstructured":"Sridharan N, Elias MD, Subramanian VSA (2007) Total reinforcement number of a graph. AKCE Int J Graph Comb 4(2):192\u2013202"},{"key":"9597_CR21","volume-title":"Theory and application of graphs","author":"J-M Xu","year":"2003","unstructured":"Xu J-M (2003) Theory and application of graphs. Kluwer Academic Publishers, Dordrecht"},{"key":"9597_CR22","first-page":"140","volume":"23","author":"JH Zhang","year":"2003","unstructured":"Zhang JH, Liu HL, Sun L (2003) Independence bondage and reinforcement number of some graphs. Trans Beijing Inst Technol 23:140\u2013142","journal-title":"Trans Beijing Inst Technol"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9597-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-013-9597-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9597-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:23:20Z","timestamp":1559276600000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-013-9597-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,2,23]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,2]]}},"alternative-id":["9597"],"URL":"https:\/\/doi.org\/10.1007\/s10878-013-9597-9","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,2,23]]}}}