{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,3,24]],"date-time":"2023-03-24T10:29:03Z","timestamp":1679653743944},"reference-count":12,"publisher":"World Scientific Pub Co Pte Lt","issue":"02","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2017,4]]},"abstract":"<jats:p> In this paper, we study the signed [Formula: see text]-domination and its total version in graphs. By a simple uniform approach we give some new upper and lower bounds on these two parameters of a graph in terms of several different graph parameters. In this way, we can improve and generalize some results in literature. Moreover, we make use of the well-known theorem of Tur\u00e1n [On an extremal problem in graph theory, Math. Fiz. Lapok 48 (1941) 436\u2013452] to bound the signed total [Formula: see text]-domination number, [Formula: see text], of a [Formula: see text]-free graph [Formula: see text] for [Formula: see text]. <\/jats:p>","DOI":"10.1142\/s1793830917500240","type":"journal-article","created":{"date-parts":[[2017,2,10]],"date-time":"2017-02-10T05:55:11Z","timestamp":1486706111000},"page":"1750024","source":"Crossref","is-referenced-by-count":3,"title":["New and improved results on the signed (total) k-domination number of graphs"],"prefix":"10.1142","volume":"09","author":[{"given":"D. A.","family":"Mojdeh","sequence":"first","affiliation":[{"name":"Department of Mathematics, University of Mazandaran, Babolsar, Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Babak","family":"Samadi","sequence":"additional","affiliation":[{"name":"Department of Mathematics, University of Mazandaran, Babolsar, Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2017,4,13]]},"reference":[{"key":"S1793830917500240BIB001","doi-asserted-by":"publisher","DOI":"10.2478\/s11533-010-0077-5"},{"key":"S1793830917500240BIB002","first-page":"311","volume-title":"Graph Theory, Combinatorics and Applications","author":"Dunbar J. E.","year":"1995"},{"key":"S1793830917500240BIB003","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2009.04.014"},{"key":"S1793830917500240BIB004","doi-asserted-by":"publisher","DOI":"10.1016\/S1571-0653(04)00118-0"},{"key":"S1793830917500240BIB005","first-page":"201","volume":"55","author":"Harary F.","year":"2000","journal-title":"Ars Combin."},{"key":"S1793830917500240BIB006","first-page":"5","volume":"28","author":"Henning M. A.","year":"1999","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"S1793830917500240BIB007","first-page":"87","volume":"89","author":"Liang H.","year":"2014","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"S1793830917500240BIB008","first-page":"241","volume":"18","author":"Sheikholeslami S. M.","year":"2010","journal-title":"An. Stiint Univ. Ovidius Constanta Ser. Math."},{"key":"S1793830917500240BIB009","first-page":"436","volume":"48","author":"Tur\u00e1n P.","year":"1941","journal-title":"Math. Fiz. Lapok"},{"key":"S1793830917500240BIB010","first-page":"205","volume":"106","author":"Wang C.","year":"2012","journal-title":"Ars Combin."},{"key":"S1793830917500240BIB011","volume-title":"Introduction to Graph Theory","author":"West D. B.","year":"2001","edition":"2"},{"key":"S1793830917500240BIB012","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013782511179"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830917500240","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T13:14:41Z","timestamp":1565183681000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830917500240"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,4]]},"references-count":12,"journal-issue":{"issue":"02","published-online":{"date-parts":[[2017,4,13]]},"published-print":{"date-parts":[[2017,4]]}},"alternative-id":["10.1142\/S1793830917500240"],"URL":"https:\/\/doi.org\/10.1142\/s1793830917500240","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,4]]}}}