%0 Journal Article %T Roman domination in signed graphs %J Communications in Combinatorics and Optimization %I Azarbaijan Shahid Madani University %Z 2538-2128 %A Joseph, James %A JOSEPH, MAYAMMA %D 2023 %\ 06/01/2023 %V 8 %N 2 %P 349-358 %! Roman domination in signed graphs %K domination %K Dominating functions %K Roman dominating functions %R 10.22049/cco.2022.27438.1264 %X Let $S = (G,\sigma)$ be a signed graph. A function $f: V \rightarrow \{0,1,2\}$ is a Roman dominating function on $S$ if $(i)$ for each $v \in V,$ $f(N[v]) = f(v) + \sum_{u \in N(v)} \sigma(uv ) f(u) \geq 1$ and $(ii)$ for each vertex $ v $ with $ f(v) = 0 $ there exists a vertex $u \in N^+(v)$ such that $f(u) = 2.$ In this paper we initiate a study on Roman dominating function on signed graphs. We characterise the signed paths, cycles and stars that admit a Roman dominating function. %U http://comb-opt.azaruniv.ac.ir/article_14371_3bbfc17544e5ea83d52e3dcafa453995.pdf