{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T13:09:02Z","timestamp":1753880942601,"version":"3.41.2"},"reference-count":13,"publisher":"World Scientific Pub Co Pte Ltd","issue":"05","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2023,7]]},"abstract":"<jats:p> Let [Formula: see text] be a finite simple directed graph (shortly digraph). A function [Formula: see text] is called a twin signed double Roman dominating function (TSDRDF) if (i) every vertex [Formula: see text] with [Formula: see text] has at least two in-neighbor assigned a 2 or at least an in-neighbor [Formula: see text] with [Formula: see text], also at least two out-neighbor assigned a 2 or at least an out-neighbor [Formula: see text] with [Formula: see text] (ii) every vertex [Formula: see text] with [Formula: see text] is adjacent to at least an in-neighbor and an out-neighbor [Formula: see text] with [Formula: see text] and (iii) [Formula: see text] and [Formula: see text] hold for any vertex [Formula: see text]. The weight of a TSDRDF [Formula: see text] is [Formula: see text], the twin signed double Roman domination number [Formula: see text] of [Formula: see text] is the minimum weight of a TSDRDF on [Formula: see text]. In this paper, we initiate the study of twin signed double Roman domination in digraphs and we present some bounds for [Formula: see text]. <\/jats:p>","DOI":"10.1142\/s179383092250121x","type":"journal-article","created":{"date-parts":[[2022,6,14]],"date-time":"2022-06-14T07:37:25Z","timestamp":1655192245000},"source":"Crossref","is-referenced-by-count":0,"title":["Twin signed double Roman domination numbers in directed graphs"],"prefix":"10.1142","volume":"15","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1943-5552","authenticated-orcid":false,"given":"Akram","family":"Mahmoodi","sequence":"first","affiliation":[{"name":"Department of Mathematics, Payame Noor University, I. R. Iran"}]},{"given":"Maryam","family":"Atapour","sequence":"additional","affiliation":[{"name":"Department of Mathematics and Computer Sciences, Faculty of Basic Sciences, University of Bonab, Bonab, I. R. Iran"}]},{"given":"Sattar","family":"Aliyar","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Azarbaijan Shahid Madani University, Tabriz, I. R. Iran"}]}],"member":"219","published-online":{"date-parts":[[2022,7,30]]},"reference":[{"key":"S179383092250121XBIB001","doi-asserted-by":"publisher","DOI":"10.1142\/S1793830917500501"},{"issue":"2","key":"S179383092250121XBIB002","first-page":"194","volume":"48","author":"Amjadi J.","year":"2021","journal-title":"Ann. Univ. Craiova, Math. Comput. Science Series"},{"key":"S179383092250121XBIB003","first-page":"71","volume":"24","author":"Atapour M.","year":"2017","journal-title":"Algebra Discrete Math."},{"key":"S179383092250121XBIB004","doi-asserted-by":"crossref","first-page":"1048","DOI":"10.2478\/s11533-010-0077-5","volume":"8","author":"Atapour M.","year":"2010","journal-title":"Cent. Eur. J. Math."},{"key":"S179383092250121XBIB005","first-page":"311","volume-title":"Graph Theory, Combinatorics, and Applications, Proc. 7th Int. Conf. Combinatorics, Graph Theory, Applications","volume":"1","author":"Dunbar J. E.","year":"1995"},{"key":"S179383092250121XBIB006","doi-asserted-by":"crossref","first-page":"2567","DOI":"10.1016\/j.disc.2008.04.001","volume":"309","author":"Karami H.","year":"2009","journal-title":"Discrete Math."},{"issue":"2","key":"S179383092250121XBIB007","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1142\/S1793830920500287","volume":"12","author":"Mahmoodi A.","year":"2020","journal-title":"Discrete Math. Algorithms Appl."},{"issue":"1","key":"S179383092250121XBIB008","doi-asserted-by":"crossref","first-page":"2050009","DOI":"10.1142\/S1793830920500093","volume":"12","author":"Shahbazi L.","year":"2020","journal-title":"Discrete Math. Algorithms Appl."},{"key":"S179383092250121XBIB009","doi-asserted-by":"crossref","first-page":"261","DOI":"10.7151\/dmgt.1929","volume":"37","author":"Volkmann L.","year":"2017","journal-title":"Discuss. Math. Graph Theory"},{"key":"S179383092250121XBIB010","first-page":"205","volume":"106","author":"Wang C.","year":"2012","journal-title":"Ars Combin."},{"volume-title":"Introduction to Graph Theory","year":"2000","author":"West D. B.","key":"S179383092250121XBIB011"},{"key":"S179383092250121XBIB012","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1007\/s10587-005-0038-5","volume":"55","author":"Zelinka B.","year":"2005","journal-title":"Czechoslovak Math. J."},{"key":"S179383092250121XBIB013","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/S0012-365X(98)00189-7","volume":"195","author":"Zhang Z.","year":"1999","journal-title":"Discrete Math."}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S179383092250121X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,23]],"date-time":"2023-05-23T03:18:35Z","timestamp":1684811915000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S179383092250121X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,30]]},"references-count":13,"journal-issue":{"issue":"05","published-print":{"date-parts":[[2023,7]]}},"alternative-id":["10.1142\/S179383092250121X"],"URL":"https:\/\/doi.org\/10.1142\/s179383092250121x","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"type":"print","value":"1793-8309"},{"type":"electronic","value":"1793-8317"}],"subject":[],"published":{"date-parts":[[2022,7,30]]},"article-number":"2250121"}}