Signed mixed Roman domination numbers in graphs (Q328725)

A signed mixed Roman dominating function (SMRDF) on a graph \(G=(V,E)\) is a function \(f:V\cup E\to\{-1,1,2\}\) satisfying the conditions (i) the sum of its function values over any closed mixed neighborhood of an element \(x\in V\cup E\) (the mixed closed neighborhood consists of \(x\) and the elements of \(V\cup E\) adjacent or incident to \(x\)) is at least one and (ii) for every element \(u\in V\cup E\) for which \(f(u)=-1\) is adjacent or incident to at least one element \(v\in V\cup E\) with \(f(v)=2\). The weight of a SMRDF is the sum of its function values over all element in \(v\in V\cup E\). The signed mixed Roman domination number of \(G\) is the minimum weight of a SMRDF in \(G\) and is denoted by \(\gamma^*_{sR}(G)\). In this paper, the authors initiated the study of this parameter and present bounds for it. In particular, they determine \(\gamma^\ast_{sR}(G)\) for some classes of graphs such as paths and cycles.