{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T16:39:19Z","timestamp":1740155959541,"version":"3.37.3"},"reference-count":5,"publisher":"World Scientific Pub Co Pte Ltd","issue":"02","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2020,4]]},"abstract":"<jats:p> Let [Formula: see text] be a finite and simple graph of order [Formula: see text] and maximum degree [Formula: see text]. A signed strong Roman dominating function on a graph [Formula: see text] is a function [Formula: see text] satisfying the conditions that (i) for every vertex [Formula: see text] of [Formula: see text], [Formula: see text], where [Formula: see text] is the closed neighborhood of [Formula: see text] and (ii) every vertex [Formula: see text] for which [Formula: see text] is adjacent to at least one vertex [Formula: see text] for which [Formula: see text], where [Formula: see text]. The minimum of the values [Formula: see text], taken over all signed strong Roman dominating functions [Formula: see text] of [Formula: see text], is called the signed strong Roman domination number of [Formula: see text] and is denoted by [Formula: see text]. In this paper, we continue the study signed strong Roman domination number of a graph and give several bounds for this parameter. Then, among other results, we determine the signed strong Roman domination number of special classes of graphs. <\/jats:p>","DOI":"10.1142\/s1793830920500287","type":"journal-article","created":{"date-parts":[[2020,1,30]],"date-time":"2020-01-30T07:51:14Z","timestamp":1580370674000},"page":"2050028","source":"Crossref","is-referenced-by-count":2,"title":["On the signed strong Roman domination number of graphs"],"prefix":"10.1142","volume":"12","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1943-5552","authenticated-orcid":false,"given":"A.","family":"Mahmoodi","sequence":"first","affiliation":[{"name":"Department of Mathematics, Payame Noor University, P.O. Box 19395-3697 Tehran, Iran"}]}],"member":"219","published-online":{"date-parts":[[2020,3,17]]},"reference":[{"key":"S1793830920500287BIB001","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-012-9500-0"},{"key":"S1793830920500287BIB002","doi-asserted-by":"publisher","DOI":"10.5556\/j.tkjm.48.2017.2240"},{"key":"S1793830920500287BIB003","first-page":"14","volume":"1","author":"Dehgardi N.","year":"2016","journal-title":"J. Comb. Optim."},{"key":"S1793830920500287BIB004","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(96)00026-X"},{"key":"S1793830920500287BIB005","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-013-9648-2"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830920500287","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,18]],"date-time":"2020-05-18T05:59:35Z","timestamp":1589781575000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830920500287"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,3,17]]},"references-count":5,"journal-issue":{"issue":"02","published-print":{"date-parts":[[2020,4]]}},"alternative-id":["10.1142\/S1793830920500287"],"URL":"https:\/\/doi.org\/10.1142\/s1793830920500287","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"type":"print","value":"1793-8309"},{"type":"electronic","value":"1793-8317"}],"subject":[],"published":{"date-parts":[[2020,3,17]]}}}