Results 231 to 240 of about 9,767,318 (248)

A Roman Domination Chain

Graphs and Combinatorics, 2016
For a graph (Formula presented.), a Roman dominating function (Formula presented.) has the property that every vertex (Formula presented.) with (Formula presented.) has a neighbor (Formula presented.) with (Formula presented.).
Teresa W. Haynes, Stephen Hedetniemi, Alice A McRae   +2 more
exaly   +2 more sources

Double Roman Domination: A Survey

Mathematics, 2023
Since 2016, when the first paper of the double Roman domination appeared, the topic has received considerable attention in the literature. We survey known results on double Roman domination and some variations of the double Roman domination, and a list ...
Janez Žerovnik, Darja Rupnik-Poklukar
exaly   +2 more sources

Bounds on Weak Roman and 2-Rainbow Domination Numbers

Discrete Applied Mathematics, 2014
We mainly study two related dominating functions, namely, the weak Roman and 2-rainbow dominating functions. We show that for all graphs, the weak Roman domination number is bounded above by the 2-rainbow domination number.
Teresa W. Haynes, Stephen Hedetniemi
exaly   +2 more sources

On the Strong Roman Domination Number of Graphs [PDF]

Discrete Applied Mathematics, 2017
Based on the history that the Emperor Constantine decreed that any undefended place (with no legions) of the Roman Empire must be protected by a “stronger” neighbor place (having two legions), a graph theoretical model called Roman domination in graphs ...
Ismael Gonzalez Yero, S M Sheikholeslami
exaly   +2 more sources

Survey on Roman {2}-Domination

Mathematics
The notion of Roman {2}-domination was introduced in 2016 as a variant of Roman domination, a concept inspired by a defending strategy used by the emperor Constantine (272–337 AD) to protect the Roman Empire.
Bana Al Subaiei, Saiful R Mondal, Ahlam AlMulhim   +2 more
exaly   +2 more sources

Extremal Problems for Roman Domination [PDF]

SIAM Journal on Discrete Mathematics, 2009
A Roman dominating function of a graph G is a labeling f: V(G) →{0,1,2} such that every vertex with a label 0 has a neighbor with label 2. The Roman domination number γR(G) of G is the minimum of ∑ʋϵV(G)f(v) over such functions.
Douglas West
exaly   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Total Roman {2}-Domination in Graphs

Quaestiones Mathematicae, 2021
Ismael Gonzalez Yero, Suitberto Cabrera, Abel Cabrera Martinez   +2 more
exaly  

Triple Roman Domination in Graphs

Applied Mathematics and Computation, 2021
H Abdollahzadeh Ahangar, S M Sheikholeslami   +1 more
exaly  

Varieties of Roman Domination II

AKCE International Journal of Graphs and Combinatorics, 2020
Mustapha Chellali, Seyed Mahmoud Sheikholeslami, Lutz Volkmann   +2 more
exaly  

Roman {3}-Domination (Double Italian Domination)

Discrete Applied Mathematics, 2020
Doost Ali Mojdeh, Lutz Volkmann
exaly