{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T16:39:33Z","timestamp":1740155973453,"version":"3.37.3"},"reference-count":16,"publisher":"World Scientific Pub Co Pte Ltd","issue":"02","funder":[{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"crossref","award":["11701257","11571005","11801253"],"award-info":[{"award-number":["11701257","11571005","11801253"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Key Project in Universities of Henan Province","award":["18A110025","2018 XJGGJS-10"],"award-info":[{"award-number":["18A110025","2018 XJGGJS-10"]}]}],"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 simple graph with vertex set [Formula: see text] and edge set [Formula: see text]. A signed Roman dominating function (SRDF) of [Formula: see text] is a function [Formula: see text] satisfying the conditions that (i) [Formula: see text] for each [Formula: see text], where [Formula: see text] is the set, called closed neighborhood of [Formula: see text], consists of [Formula: see text] and the vertex of [Formula: see text] adjacent to [Formula: see text] (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]. The weight of a SRDF [Formula: see text] is [Formula: see text]. The signed Roman domination number [Formula: see text] of [Formula: see text] is the minimum weight of a SRDF of [Formula: see text]. In this paper, we determine the exact values of signed Roman domination number of spider and double star. Specially, one of them generalizes the known result. <\/jats:p>","DOI":"10.1142\/s179383092050024x","type":"journal-article","created":{"date-parts":[[2020,1,30]],"date-time":"2020-01-30T07:51:14Z","timestamp":1580370674000},"page":"2050024","source":"Crossref","is-referenced-by-count":2,"title":["The signed Roman domination number of two classes graphs"],"prefix":"10.1142","volume":"12","author":[{"given":"Xia","family":"Hong","sequence":"first","affiliation":[{"name":"Department of Mathematics, Luoyang Normal University, Luoyang 471022, P. R. China"}]},{"given":"Tianhu","family":"Yu","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Luoyang Normal University, Luoyang 471022, P. R. China"}]},{"given":"Zhengbang","family":"Zha","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Luoyang Normal University, Luoyang 471022, P. R. China"}]},{"given":"Huihui","family":"Zhang","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Luoyang Normal University, Luoyang 471022, P. R. China"}]}],"member":"219","published-online":{"date-parts":[[2020,2,28]]},"reference":[{"key":"S179383092050024XBIB001","first-page":"171","volume":"77","author":"Ahangar H. A.","year":"2014","journal-title":"J. Comb. Optim."},{"key":"S179383092050024XBIB002","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-014-9747-8"},{"key":"S179383092050024XBIB003","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-012-9500-0"},{"key":"S179383092050024XBIB004","doi-asserted-by":"publisher","DOI":"10.7151\/dmgt.1984"},{"key":"S179383092050024XBIB005","first-page":"65","volume":"4","author":"Behtoei A.","year":"2016","journal-title":"J. Algebraic Syst."},{"key":"S179383092050024XBIB006","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84628-970-5"},{"key":"S179383092050024XBIB007","doi-asserted-by":"publisher","DOI":"10.1137\/070699688"},{"key":"S179383092050024XBIB008","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2003.06.004"},{"key":"S179383092050024XBIB009","first-page":"311","volume-title":"Graph Theory, Combinatorics, and Applications","author":"Dunbar J. E.","year":"1995"},{"key":"S179383092050024XBIB010","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480100375831"},{"volume-title":"Fundamentals of Domination in Graphs","year":"1998","author":"Haynes T. W.","key":"S179383092050024XBIB011"},{"volume-title":"Domination in Graphs: Advanced Topics","year":"1998","author":"Haynes T. W.","key":"S179383092050024XBIB012"},{"key":"S179383092050024XBIB013","doi-asserted-by":"publisher","DOI":"10.5614\/ejgta.2015.3.1.9"},{"key":"S179383092050024XBIB014","doi-asserted-by":"publisher","DOI":"10.1016\/j.endm.2009.03.010"},{"key":"S179383092050024XBIB015","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-015-9906-6"},{"key":"S179383092050024XBIB016","first-page":"318","volume":"33","author":"Yancai Z.","year":"2017","journal-title":"Commun. Math. Res."}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S179383092050024X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,18]],"date-time":"2020-05-18T05:58:57Z","timestamp":1589781537000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S179383092050024X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2,28]]},"references-count":16,"journal-issue":{"issue":"02","published-print":{"date-parts":[[2020,4]]}},"alternative-id":["10.1142\/S179383092050024X"],"URL":"https:\/\/doi.org\/10.1142\/s179383092050024x","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"type":"print","value":"1793-8309"},{"type":"electronic","value":"1793-8317"}],"subject":[],"published":{"date-parts":[[2020,2,28]]}}}