Results 221 to 230 of about 53,396 (255)

Signed Roman domination in digraphs

Journal of Combinatorial Optimization, 2013
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
S M Sheikholeslami, Lutz Volkmann
exaly   +2 more sources

Outer independent signed double Roman domination

Journal of Applied Mathematics and Computing, 2021
Suppose $$[3]=\{0,1,2,3\}$$ and $$[3^{-}]=\{-1,1,2,3\}$$ . An outer independent signed double Roman dominating function (OISDRDF) of a graph
Mustapha Chellali, S M Sheikholeslami
exaly   +2 more sources

Signed Roman domination in graphs

Journal of Combinatorial Optimization, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Michael A Henning   +1 more
exaly   +3 more sources

Signed Roman $$k$$ k -Domination in Graphs

Graphs and Combinatorics, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Michael A Henning, Lutz Volkmann
exaly   +2 more sources

Signed Roman k-domination in Digraphs

Graphs and Combinatorics, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lutz Volkmann
exaly   +3 more sources

Signed Roman edge domination numbers in graphs

Journal of Combinatorial Optimization, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
J Amjadi   +2 more
exaly   +2 more sources

Signed mixed Roman domination numbers in graphs

Journal of Combinatorial Optimization, 2015
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
S M Sheikholeslami, Lutz Volkmann
exaly   +2 more sources

Home - About - Disclaimer - Privacy