{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T01:59:15Z","timestamp":1648951155788},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2019,7,29]],"date-time":"2019-07-29T00:00:00Z","timestamp":1564358400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,7,29]],"date-time":"2019-07-29T00:00:00Z","timestamp":1564358400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2019,9]]},"DOI":"10.1007\/s00373-019-02065-8","type":"journal-article","created":{"date-parts":[[2019,7,29]],"date-time":"2019-07-29T17:02:38Z","timestamp":1564419758000},"page":"1153-1160","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Upper Bounds for the Domination Numbers of Graphs Using Tur\u00e1n\u2019s Theorem and Lov\u00e1sz Local Lemma"],"prefix":"10.1007","volume":"35","author":[{"given":"Sharareh","family":"Alipour","sequence":"first","affiliation":[]},{"given":"Amir","family":"Jafari","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,7,29]]},"reference":[{"key":"2065_CR1","volume-title":"Fundamentals of Domination in Graphs","author":"TW Haynes","year":"1998","unstructured":"Haynes, T.W., Hedetniemi, S., Slater, P.: Fundamentals of Domination in Graphs. CRC Press, Boca Raton (1998)"},{"key":"2065_CR2","unstructured":"Haynes, T.W., Hedetniemi, S., Slater, P.J.: Fundamentals of domination in graphs. In: Monographs and Textbooks in Pure and Applied Mathematics, vol. 208. Marcel Dekker, Inc., New York (1998)"},{"key":"2065_CR3","doi-asserted-by":"crossref","unstructured":"Chang, G.J.: Algorithmic Aspects of Domination in Graphs. In: Handbook of combinatorial optimization, pp. 1811\u20131877. Springer, New York (1998)","DOI":"10.1007\/978-1-4613-0303-9_28"},{"key":"2065_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-58412-1","volume-title":"Complexity and Approximation","author":"G Ausiello","year":"1999","unstructured":"Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and Approximation. Springer, Heidelberg (1999)"},{"issue":"3","key":"2065_CR5","doi-asserted-by":"publisher","first-page":"415","DOI":"10.11650\/twjm\/1500558307","volume":"6","author":"C-S Liao","year":"2002","unstructured":"Liao, C.-S., Chang, G.J.: Algorithmic aspect of $$k$$-tuple domination in graphs. Taiwan. J. Math. 6(3), 415\u2013420 (2002)","journal-title":"Taiwan. J. Math."},{"issue":"1","key":"2065_CR6","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/S0020-0190(03)00233-3","volume":"87","author":"C-S Liao","year":"2003","unstructured":"Liao, C.-S., Chang, G.J.: k-tuple domination in graphs. Inf. Process. Lett. 87(1), 45\u201350 (2003)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"2065_CR7","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.ipl.2003.10.004","volume":"89","author":"R Klasing","year":"2004","unstructured":"Klasing, R., Laforest, C.: Hardness results and approximation algorithms of k-tuple domination in graphs. Inf. Process. Lett. 89(2), 75\u201383 (2004)","journal-title":"Inf. Process. Lett."},{"issue":"1\u20133","key":"2065_CR8","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/0012-365X(94)00373-Q","volume":"155","author":"F Harary","year":"1996","unstructured":"Harary, F., Haynes, T.W.: Nordhaus-Gaddum inequalities for domination in graphs. Discr. Math. 155(1\u20133), 99\u2013105 (1996)","journal-title":"Discr. Math."},{"issue":"4","key":"2065_CR9","doi-asserted-by":"publisher","first-page":"1336","DOI":"10.1137\/090777001","volume":"24","author":"MA Henning","year":"2010","unstructured":"Henning, M.A., Yeo, A.: Strong transversals in hypergraphs and double total domination in graphs. SIAM J. Discr. Math. 24(4), 1336\u20131355 (2010)","journal-title":"SIAM J. Discr. Math."},{"issue":"5","key":"2065_CR10","doi-asserted-by":"publisher","first-page":"1333","DOI":"10.1016\/j.ejc.2007.05.009","volume":"29","author":"GJ Chang","year":"2008","unstructured":"Chang, G.J.: The upper bound on k-tuple domination numbers of graphs. Eur. J. Combin. 29(5), 1333\u20131336 (2008)","journal-title":"Eur. J. Combin."},{"issue":"2","key":"2065_CR11","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1515\/tmj-2015-0027","volume":"8","author":"AP Kazemi","year":"2015","unstructured":"Kazemi, A.P.: A note on the $$k$$-tuple total domination number of a graph. Tbilisi Math. J. 8(2), 281\u2013286 (2015)","journal-title":"Tbilisi Math. J."},{"key":"2065_CR12","unstructured":"Alipour, S., Jafari, A., Saghafian, M.: On $$k$$-tuple and $$k$$-tuple total domination of regular graphs. \n                    arXiv:1709.01245\n                    \n                   (2017)"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-019-02065-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-019-02065-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-019-02065-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,27]],"date-time":"2020-07-27T23:41:48Z","timestamp":1595893308000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-019-02065-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7,29]]},"references-count":12,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2019,9]]}},"alternative-id":["2065"],"URL":"https:\/\/doi.org\/10.1007\/s00373-019-02065-8","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,7,29]]},"assertion":[{"value":"18 November 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 June 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 July 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}