{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T06:09:51Z","timestamp":1774418991110,"version":"3.50.1"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T00:00:00Z","timestamp":1772236800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T00:00:00Z","timestamp":1772236800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100003399","name":"Science and Technology Commission of Shanghai Municipality","doi-asserted-by":"publisher","award":["22JC1403600"],"award-info":[{"award-number":["22JC1403600"]}],"id":[{"id":"10.13039\/501100003399","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Oper. Res. Forum"],"DOI":"10.1007\/s43069-026-00619-0","type":"journal-article","created":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T11:38:48Z","timestamp":1772278728000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Outer-Independent Signed Roman Domination Function in Graphs"],"prefix":"10.1007","volume":"7","author":[{"given":"Ning","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peng","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianhui","family":"Shang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,2,28]]},"reference":[{"key":"619_CR1","doi-asserted-by":"crossref","unstructured":"Haynes TW, Hedetniemi ST, Slater PJ (1998) Fundamentals of domination in graphs. Marcel Dekker Inc., New York","DOI":"10.1002\/(SICI)1097-0037(199810)32:3<199::AID-NET4>3.0.CO;2-F"},{"issue":"1\u20133","key":"619_CR2","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/j.disc.2003.06.004","volume":"278","author":"EJ Cockayne","year":"2004","unstructured":"Cockayne EJ, Dreyer PA Jr, Hedetniemi SM, Hedetniemi ST (2004) Roman domination in graphs Discret Math 278(1\u20133):11\u201322","journal-title":"Roman domination in graphs Discret Math"},{"issue":"2","key":"619_CR3","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/s10878-012-9500-0","volume":"27","author":"H Abdollahzadeh Ahangar","year":"2014","unstructured":"Abdollahzadeh Ahangar H, Henning MA, L\u00f6wenstein C, Zhao Y (2014) Samodivkin V Signed Roman domination in graphs. J Comb Optim 27(2):241\u2013255","journal-title":"J Comb Optim"},{"issue":"1","key":"619_CR4","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/0020-0190(84)90126-1","volume":"19","author":"AA Bertossi","year":"1984","unstructured":"Bertossi AA (1984) Dominating sets for split and bipartite graphs. Inf Process Lett 19(1):37\u201340","journal-title":"Inf Process Lett"},{"issue":"2\u20133","key":"619_CR5","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/0304-3975(87)90067-3","volume":"53","author":"H M\u00fcller","year":"1987","unstructured":"M\u00fcller H, Brandst\u00e4dt A (1987) The NP-completeness of Steiner tree and dominating set for chordal bipartite graphs. Theoret Comput Sci 53(2\u20133):257\u2013265","journal-title":"Theoret Comput Sci"},{"key":"619_CR6","doi-asserted-by":"crossref","unstructured":"Chang M-S (1998) Efficient algorithms for the domination problems on interval and circular-arc graphs. SIAM J Comput 27(6):1671\u20131694","DOI":"10.1137\/S0097539792238431"},{"issue":"1\u20133","key":"619_CR7","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/S0166-218X(97)00125-X","volume":"82","author":"A Brandst\u00e4dt","year":"1998","unstructured":"Brandst\u00e4dt A, Chepoi VD, Dragan FF (1998) The algorithmic use of hypertree structure and maximum neighbourhood orderings. Discret Appl Math 82(1\u20133):43\u201377","journal-title":"Discret Appl Math"},{"key":"619_CR8","first-page":"101","volume":"12","author":"MA Henning","year":"1995","unstructured":"Henning MA (1995) The algorithmic complexity of signed domination in graphs. Australas J Comb 12:101\u2013112","journal-title":"Australas J Comb"},{"issue":"1","key":"619_CR9","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/s12190-020-01345-4","volume":"64","author":"C Padamutham","year":"2020","unstructured":"Padamutham C, Palagiri VSR (2020) Algorithmic aspects of Roman domination in graphs. J Appl Math Comput 64(1):89\u2013102","journal-title":"J Appl Math Comput"},{"key":"619_CR10","doi-asserted-by":"crossref","unstructured":"Liedloff M, Kloks T, Liu J, Peng S-L (2008) Efficient algorithms for Roman domination on some classes of graphs. Discret Appl Math 156(18):3400\u20133415","DOI":"10.1016\/j.dam.2008.01.011"},{"key":"619_CR11","unstructured":"Hsu C, Liu C, Peng S (2005) Roman domination on block graphs. In: Proceedings of the 22nd workshop on combinatorial mathematics and computation theory, pp 188\u2013191"},{"issue":"12","key":"619_CR12","doi-asserted-by":"publisher","first-page":"2547","DOI":"10.1080\/00207160.2017.1301437","volume":"94","author":"H Abdollahzadeh Ahangar","year":"2017","unstructured":"Abdollahzadeh Ahangar H, Chellali M, Samodivkin V (2017) Outer independent roman dominating functions in graphs. Int J Comput Math 94(12):2547\u20132557","journal-title":"Int J Comput Math"},{"key":"619_CR13","doi-asserted-by":"crossref","unstructured":"Sharma A, Kumar JP, Subba Reddy PV, Arumugam S (2022) Algorithmic aspects of outer independent Roman domination in graphs. Discrete Math Algorithms Appl 14(05):2250004","DOI":"10.1142\/S1793830922500045"},{"key":"619_CR14","unstructured":"Poureidi A (2023) Efficient algorithms for independent Roman domination on some classes of graphs. Commun Comb Optim 8(1):127\u2013140"},{"key":"619_CR15","doi-asserted-by":"crossref","unstructured":"Hickey G, Dehne F, Rau-Chaplin A, Blouin C (2008) SPR distance computation for unrooted trees. Evol Bioinforma 4:419","DOI":"10.4137\/EBO.S419"}],"container-title":["Operations Research Forum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43069-026-00619-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s43069-026-00619-0","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43069-026-00619-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T05:18:37Z","timestamp":1774415917000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s43069-026-00619-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2,28]]},"references-count":15,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2026,3]]}},"alternative-id":["619"],"URL":"https:\/\/doi.org\/10.1007\/s43069-026-00619-0","relation":{},"ISSN":["2662-2556"],"issn-type":[{"value":"2662-2556","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,2,28]]},"assertion":[{"value":"14 July 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 February 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 February 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics Approval and Consent to Participate"}},{"value":"All participants provided written consent acknowledging the open-access publication of their contributions.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for Publication"}},{"value":"The authors declare no competing interests.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}}],"article-number":"28"}}