Results 151 to 160 of about 98,924 (189)

Double Roman domination in some graphs

Discrete Mathematics, Algorithms and Applications
A double Roman dominating function on a graph [Formula: see text] is a function [Formula: see text] satisfying the conditions that if [Formula: see text], then every vertex v is adjacent to minimum one vertex u for which [Formula: see text] or two vertices [Formula: see text] and [Formula: see text] for which [Formula: see text] and if [Formula: see ...
J. Meena, T. N. M. Malini Mai, M. L. Suresh, Laxmi Rathour, Lakshmi Narayan Mishra   +4 more
openaire   +2 more sources

Independent Double Roman Domination in Graphs

Bulletin of the Iranian Mathematical Society, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
H R Maimani, S M Sheikholeslami
exaly   +2 more sources

Double Roman Domination in Generalized Petersen Graphs

Bulletin of the Iranian Mathematical Society, 2021
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gao, Hong, Huang, Jiahuan, Yang, Yuansheng   +2 more
openaire   +2 more sources

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   +2 more sources

Meta-heuristic Algorithms for Double Roman Domination Problem

Applied Soft Computing Journal
Himanshu Aggarwal, P Venkata Subba Reddy   +1 more
exaly   +2 more sources

Majority double Roman domination in graphs

Discrete Mathematics, Algorithms and Applications, 2023
A majority double Roman dominating function (MDRDF) on a graph [Formula: see text] is a function [Formula: see text] such that (i) every vertex [Formula: see text] with [Formula: see text] is adjacent to at least two vertices assigned with 2 or to at least one vertex [Formula: see text] with [Formula: see text], (ii) every vertex [Formula: see text ...
S. Anandha Prabhavathy, I. Sahul Hamid
openaire   +2 more sources

On algorithmic complexity of double Roman domination

Discrete Applied Mathematics, 2020
A double Roman dominating function on a graph \(G=(V,E)\) is a function \(f:V\rightarrow \{0,1,2,3\}\) such that every vertex \(v \in V\) with \(f(v)=0\) is either adjacent to a vertex \(u\) with \(f(u)=3\) or two distinct vertices \(x\) and \(y\) with \(f(x)=f(y)=2\), and every vertex \(v \in V\) with \(f(v)=1\) is adjacent to a vertex \(u\) with \(f ...
Abolfazl Poureidi, Nader Jafari Rad
openaire   +2 more sources

On the Global Double Roman Domination of Graphs

Bulletin of the Malaysian Mathematical Sciences Society, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Guoliang Hao, Xiaodan Chen
openaire   +2 more sources

Total double Roman domination numbers in digraphs

Discrete Mathematics, Algorithms and Applications, 2021
Let [Formula: see text] be a finite and simple digraph with vertex set [Formula: see text]. A double Roman dominating function (DRDF) on digraph [Formula: see text] is a function [Formula: see text] such that every vertex with label 0 has an in-neighbor with label 3 or two in-neighbors with label 2 and every vertex with label 1 have at least one in ...
Jafar Amjadi, F. Pourhosseini
openaire   +2 more sources

Notes on double Roman domination edge critical graphs

RAIRO Oper. Res.
Given a graph G=(V,E), a double Roman dominating function (DRDF) on a graph G is a function f:V→{0,1,2,3} satisfying the condition that every vertex u for which f(u)=0 is adjacent to at least one vertex v for which f(v)=3 or two vertices v₁ and v₂ for ...
A. Omar, A. Bouchou
semanticscholar   +1 more source