{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,15]],"date-time":"2025-10-15T17:56:13Z","timestamp":1760550973547,"version":"3.37.3"},"reference-count":11,"publisher":"World Scientific Pub Co Pte Ltd","issue":"01","funder":[{"DOI":"10.13039\/501100006011","name":"Babol Noshirvani University of Technology","doi-asserted-by":"publisher","award":["BNUT\/385001\/98"],"award-info":[{"award-number":["BNUT\/385001\/98"]}],"id":[{"id":"10.13039\/501100006011","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2020,2]]},"abstract":"<jats:p> A signed total double Roman [Formula: see text]-dominating function (STDRkDF) on an isolated-free graph [Formula: see text] is a function [Formula: see text] such that (i) every vertex [Formula: see text] with [Formula: see text] has at least two neighbors assigned 2 under [Formula: see text] or at least one neighbor [Formula: see text] with [Formula: see text], (ii) every vertex [Formula: see text] with [Formula: see text] has at least one neighbor [Formula: see text] with [Formula: see text] and (iii) [Formula: see text] holds for any vertex [Formula: see text]. The weight of an STDRkDF is the value [Formula: see text] The signed total double Roman [Formula: see text]-domination number [Formula: see text] is the minimum weight among all STDRkDFs on [Formula: see text]. In this paper, we initiate the study of the signed total double Roman [Formula: see text]-domination in graphs and present some sharp bounds for this parameter. In addition, we determine the signed total double Roman [Formula: see text]-domination of paths for [Formula: see text]. <\/jats:p>","DOI":"10.1142\/s1793830920500093","type":"journal-article","created":{"date-parts":[[2019,10,31]],"date-time":"2019-10-31T02:42:46Z","timestamp":1572489766000},"page":"2050009","source":"Crossref","is-referenced-by-count":5,"title":["Signed total double Roman k-domination in graphs"],"prefix":"10.1142","volume":"12","author":[{"given":"L.","family":"Shahbazi","sequence":"first","affiliation":[{"name":"Department of Mathematics, Azarbaijan Shahid Madani University, Tabriz, I. R. Iran"}]},{"given":"H. Abdollahzadeh","family":"Ahangar","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Babol Noshirvani University of Technology, Shariati Ave., Babol, I. R. Iran, Postal Code: 47148-71167,"}]},{"given":"R.","family":"Khoeilar","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Azarbaijan Shahid Madani University, Tabriz, I. R. Iran"}]},{"given":"S. M.","family":"Sheikholeslami","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Azarbaijan Shahid Madani University, Tabriz, I. R. Iran"}]}],"member":"219","published-online":{"date-parts":[[2019,12,24]]},"reference":[{"key":"S1793830920500093BIB002","doi-asserted-by":"publisher","DOI":"10.1007\/s40995-018-0535-7"},{"key":"S1793830920500093BIB003","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2017.06.014"},{"key":"S1793830920500093BIB004","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2018.09.009"},{"key":"S1793830920500093BIB005","doi-asserted-by":"publisher","DOI":"10.2298\/FIL1901121A"},{"key":"S1793830920500093BIB006","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-012-9500-0"},{"key":"S1793830920500093BIB007","first-page":"82","volume":"72","author":"Amjadi J.","year":"2018","journal-title":"Austr. J. Combin."},{"key":"S1793830920500093BIB008","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2016.03.017"},{"key":"S1793830920500093BIB009","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2010.01.009"},{"key":"S1793830920500093BIB010","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-011-9389-z"},{"key":"S1793830920500093BIB013","doi-asserted-by":"publisher","DOI":"10.1051\/ro\/2018043"},{"key":"S1793830920500093BIB014","volume-title":"Introduction to Graph Theory","author":"West D. B.","year":"2001","edition":"2"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830920500093","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,2,17]],"date-time":"2020-02-17T21:34:28Z","timestamp":1581975268000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830920500093"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12,24]]},"references-count":11,"journal-issue":{"issue":"01","published-print":{"date-parts":[[2020,2]]}},"alternative-id":["10.1142\/S1793830920500093"],"URL":"https:\/\/doi.org\/10.1142\/s1793830920500093","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"type":"print","value":"1793-8309"},{"type":"electronic","value":"1793-8317"}],"subject":[],"published":{"date-parts":[[2019,12,24]]}}}