Results 181 to 190 of about 302 (207)

An Upper Bound on the Double Roman Domination Number

Bulletin of the Iranian Mathematical Society, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ouldrabah, Lyes, Volkmann, Lutz
openaire   +1 more source

Upper bounds on the \(k\)-domination number and the \(k\)-Roman domination number

Discret. Appl. Math., 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Adriana Hansberg, Lutz Volkmann
openaire   +1 more source

Signed Roman edge domination numbers in graphs

Journal of Combinatorial Optimization, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hossein Abdollahzadeh Ahangar, Jafar Amjadi, Seyed Mahmoud Sheikholeslami, Lutz Volkmann, Yancai Zhao   +4 more
openaire   +1 more source

Extremal problems on weak Roman domination number

Information Processing Letters, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Enqiang Zhu, Zehui Shao
openaire   +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
Hossein Abdollahzadeh Ahangar, Leila Asgharsharghi, Seyed Mahmoud Sheikholeslami, Lutz Volkmann   +3 more
openaire   +1 more source

An upper bound on the double Roman domination number

Journal of Combinatorial Optimization, 2018
From the summary: ``A double Roman dominating function (DRDF) on a graph \(G=(V, E)\) is a function \(f: V\to \{0,1, 2, 3\}\) having the property that if \(f(v)=0\), then vertex \(v\) must have at least two neighbors assigned \(2\) under \(f\) or one neighbor \(w\) with \(f(w)=3\), and if \(f(v)=1\), then vertex \(v\) must have at least one neighbor ...
Jafar Amjadi, Sakineh Nazari-Moghaddam, Seyed Mahmoud Sheikholeslami, Lutz Volkmann   +3 more
openaire   +2 more sources

On the signed strong Roman domination number of graphs

Discrete Mathematics, Algorithms and Applications, 2020
Let [Formula: see text] be a finite and simple graph of order [Formula: see text] and maximum degree [Formula: see text]. A signed strong Roman dominating function on a graph [Formula: see text] is a function [Formula: see text] satisfying the conditions that (i) for every vertex [Formula: see text] of [Formula: see text], [Formula: see text], where ...
openaire   +2 more sources

A note on the double Roman domination number of graphs

Czechoslovak Mathematical Journal, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

The Roman domination number of comaximal ideal graph

Summary: Let \(G=(V(G), E(G))\) be a graph. A Roman dominating function \(\varphi\) is a coloring of the vertices of \(G\) with the colors \(\{0, 1, 2\}\) such that every vertex colored \(0\) is adjacent to at least one vertex colored \(2\). The weight of \(\varphi\) is defined to be \(\sum_{x\in V(G)}\varphi (x)\).
Khojasteh, Soheila, Heydari, Farideh
openaire   +2 more sources

Double Roman Domination: A Survey

Mathematics, 2023
Darja Rupnik Poklukar, Janez Žerovnik, Žerovnik Janez   +2 more
exaly