Results 231 to 240 of about 838 (256)

Signed total double Roman k-domination in graphs

Discrete Mathematics, Algorithms and Applications, 2019
A signed total double Roman [Formula: see text]-dominating function (STDRkDF) on an isolated-free graph [Formula: see text] is a function [Formula: see text] such that (i) every vertex [Formula: see text] with [Formula: see text] has at least two neighbors assigned 2 under [Formula: see text] or at least one neighbor [Formula: see text] with [Formula:
L. Shahbazi, Hossein Abdollahzadeh Ahangar, R. Khoeilar, Seyed Mahmoud Sheikholeslami   +3 more
openaire   +1 more source

Bounds on the signed total Roman 2-domination in graphs

Discrete Mathematics, Algorithms and Applications, 2020
Let [Formula: see text] be an integer and [Formula: see text] be a simple and finite graph with vertex set [Formula: see text]. A signed total Roman [Formula: see text]-dominating function (STR[Formula: see text]DF) on a graph [Formula: see text] is a function [Formula: see text] such that (i) every vertex [Formula: see text] with [Formula: see text ...
R. Khoeilar, L. Shahbazi, Seyed Mahmoud Sheikholeslami, Zehui Shao   +3 more
openaire   +2 more sources

Algorithmic aspects of total Roman \(\{2\}\)-domination in graphs

2021
Summary: For a simple, undirected, connected graph \(G\), a function \(h : V \rightarrow \{0,1,2\}\) is called a total Roman \(\{2\}\)-dominating function (TR2DF) if for every vertex \(v \in V\) with weight 0, either there exists a vertex \(u\) in \(N_G(v)\) with weight 2, or at least two vertices \(x\), \(y\) in \(N_G(v)\) each with weight 1, and the ...
P, Chakradhar, P, Venkata Subba Reddy
openaire   +1 more source

Algorithmic aspects of quasi-total Roman domination in graphs

2021
Summary: For a simple, undirected, connected graph \(G(V,E)\), a function \(f : V(G) \rightarrow \{0,1,2\}\) which satisfies the following conditions is called a quasi-total Roman dominating function (QTRDF) of \(G\) with weight \(f(V(G))= \sum_{v \in V(G)} f(v)\).
P, Venkata Subba Reddy, Vikas, Mangal
openaire   +1 more source

A characterization relating domination, semitotal domination and total Roman domination in trees

2020
Summary: A total Roman dominating function on a graph \(G\) is a function \(f: V(G)\rightarrow\{0,1,2\}\) such that for every vertex \(v\in V(G)\) with \(f(v)=0\) there exists a vertex \(u\in V(G)\) adjacent to \(v\) with \(f(u)=2\), and the subgraph induced by the set \(\{x\in V(G): f(x)\geq 1\}\) has no isolated vertices.
Cabrera Martinez, Abel, Martinez Arias, Alondra, Menendez Castillo, Maikel   +2 more
openaire   +2 more sources

Double Roman Domination: A Survey

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

Total Roman {2}-domination in graphs

Quaestiones Mathematicae, 2021
Suitberto Cabrera, Abel Cabrera Martinez, Frank A Hernández Mira   +2 more
exaly  

Varieties of Roman domination II

AKCE International Journal of Graphs and Combinatorics, 2020
Mustapha Chellali, Nader Jafari Rad, S M Sheikholeslami   +2 more
exaly  

Triple Roman domination in graphs

Applied Mathematics and Computation, 2021
Mustapha Chellali, S M Sheikholeslami
exaly  

Roman {3}-domination (double Italian domination)

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