{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T16:38:33Z","timestamp":1740155913072,"version":"3.37.3"},"reference-count":7,"publisher":"World Scientific Pub Co Pte Ltd","issue":"01","funder":[{"name":"the National Key R & D Program of China","award":["2019YFA0706402"],"award-info":[{"award-number":["2019YFA0706402"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2020,2]]},"abstract":"<jats:p> Let [Formula: see text] be an integer and [Formula: see text] be a simple and finite graph with vertex set [Formula: see text]. A signed total Roman [Formula: see text]-dominating function (STR[Formula: see text]DF) on a graph [Formula: see text] is a function [Formula: see text] such that (i)\u00a0every vertex [Formula: see text] with [Formula: see text] is adjacent to at least one vertex [Formula: see text] with [Formula: see text] and (ii)\u00a0[Formula: see text] holds for any vertex [Formula: see text]. The weight of an STR[Formula: see text]DF [Formula: see text] is [Formula: see text] and the minimum weight of an STR[Formula: see text]DF is the signed total Roman [Formula: see text]-domination number [Formula: see text] of [Formula: see text]. In this paper, we establish some sharp bounds on the signed total Roman 2-domination number. <\/jats:p>","DOI":"10.1142\/s1793830920500135","type":"journal-article","created":{"date-parts":[[2019,11,18]],"date-time":"2019-11-18T03:40:57Z","timestamp":1574048457000},"page":"2050013","source":"Crossref","is-referenced-by-count":4,"title":["Bounds on the signed total Roman 2-domination in graphs"],"prefix":"10.1142","volume":"12","author":[{"given":"R.","family":"Khoeilar","sequence":"first","affiliation":[{"name":"Department of Mathematics, Azarbaijan Shahid Madani University, Tabriz, I. R. Iran"}]},{"given":"L.","family":"Shahbazi","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Azarbaijan Shahid Madani University, Tabriz, I. R. Iran"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2298-4744","authenticated-orcid":false,"given":"S. M.","family":"Sheikholeslami","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Azarbaijan Shahid Madani University, Tabriz, I. R. Iran"}]},{"given":"Zehui","family":"Shao","sequence":"additional","affiliation":[{"name":"Institute of Computing Science and Technology, Guangzhou University, Guangzhou 510006, P. R. China"}]}],"member":"219","published-online":{"date-parts":[[2020,1,15]]},"reference":[{"journal-title":"Discrete Math. Algorithms Appl.","author":"Ahangar H. Abdollahzadeh","key":"S1793830920500135BIB002"},{"key":"S1793830920500135BIB003","doi-asserted-by":"publisher","DOI":"10.1142\/S1793830918500209"},{"key":"S1793830920500135BIB004","first-page":"165","volume":"1","author":"Dehgardi N.","year":"2016","journal-title":"Commun. Combin. Optim."},{"key":"S1793830920500135BIB005","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2016.06.006"},{"key":"S1793830920500135BIB006","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-015-9906-6"},{"key":"S1793830920500135BIB007","doi-asserted-by":"publisher","DOI":"10.7151\/dmgt.1970"},{"key":"S1793830920500135BIB008","first-page":"105","volume":"105","author":"Volkmann L.","year":"2018","journal-title":"J. Combin. Math. Combin. Comput."}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830920500135","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,2,17]],"date-time":"2020-02-17T21:34:06Z","timestamp":1581975246000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830920500135"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1,15]]},"references-count":7,"journal-issue":{"issue":"01","published-print":{"date-parts":[[2020,2]]}},"alternative-id":["10.1142\/S1793830920500135"],"URL":"https:\/\/doi.org\/10.1142\/s1793830920500135","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"type":"print","value":"1793-8309"},{"type":"electronic","value":"1793-8317"}],"subject":[],"published":{"date-parts":[[2020,1,15]]}}}