Results 251 to 260 of about 129,618 (274)

Isolate Roman domination in graphs

Discrete Mathematics, Algorithms and Applications, 2021
Let [Formula: see text] be a graph with the vertex set [Formula: see text]. A function [Formula: see text] is called a Roman dominating function of [Formula: see text], if every vertex [Formula: see text] with [Formula: see text] is adjacent to at least one vertex [Formula: see text] with [Formula: see text].
openaire   +1 more source

Roman [1,2]-domination of graphs

Applied Mathematics and Computation
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Guoliang Hao, Xiaodan Chen, Seyed Mahmoud Sheikholeslami, Haining Jiang   +3 more
openaire   +1 more source

Signed Roman domination in digraphs

Journal of Combinatorial Optimization, 2013
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Seyed Mahmoud Sheikholeslami, Lutz Volkmann   +1 more
openaire   +1 more source

Double Roman domination number

Discrete Applied Mathematics, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Anu V., S. Aparna Lakshmanan
openaire   +2 more sources

On the double Roman domination of graphs

Applied Mathematics and Computation, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jun Yue, Meiqin Wei
exaly   +3 more sources

Majority Roman domination in graphs

Discrete Mathematics, Algorithms and Applications, 2020
A Majority Roman Dominating Function (MRDF) on a graph [Formula: see text] is a function [Formula: see text] satisfying the conditions that (i) the sum of its function values over at least half the closed neighborhood is at least one and (ii) every vertex [Formula: see text] for which [Formula: see text] is adjacent to at least one vertex [Formula ...
openaire   +2 more sources

Mixed Roman Domination in Graphs

Bulletin of the Malaysian Mathematical Sciences Society, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ahangar, H. Abdollahzadeh, Haynes, Teresa W., Valenzuela-Tripodoro, J. C.   +2 more
openaire   +3 more sources

On Total Roman Domination in Graphs

2017
A Roman dominating function (RDF) on a graph \(G = (V,E)\) is a function \( f:V \rightarrow \lbrace 0,1,2\rbrace \) satisfying the condition that every vertex u for which \(f(u) = 0\) is adjacent to at least one vertex v for which \(f(v)=2\). A total Roman dominating function on a graph \(G = (V,E)\) is a Roman dominating function \(f : V \rightarrow ...
P. Roushini Leely Pushpam, Padmapriea Sampath   +1 more
openaire   +1 more source

Roman domination and independent Roman domination on graphs with maximum degree three

Discrete Applied Mathematics
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

On the complexity of perfect Roman domination and perfect double Roman domination

Discrete Mathematics, Algorithms and Applications
For a graph [Formula: see text] and a function [Formula: see text], let [Formula: see text] ([Formula: see text]) be the set of vertices assigned the value [Formula: see text] by [Formula: see text]. A perfect Roman dominating function on a graph [Formula: see text] is a function [Formula: see text] satisfying the condition that every vertex [Formula:
Seyed Hosein Mirhoseini, Nader Jafari Rad, Noor A’lawiah Abd Aziz, Hailiza Kamarulhaili   +3 more
openaire   +1 more source