Results 211 to 220 of about 73,869 (254)

Lower Bounds on Signed Total Double Roman k-domination in Graphs

Journal of Mathematical Sciences and Informatics
.
Laila Shahbazi, Hossein Abdollahzadeh Ahangar, Rana Khoeilar, Seyed Mahmoud Sheikholeslami   +3 more
openaire   +2 more sources

Quasi total double Roman domination in trees

2023
Summary: A quasi total double Roman dominating function (QTDRD-function) on a graph \(G=(V(G)\), \(E(G))\) is a function \(f:V(G)\longrightarrow \{0,1,2,3\}\) having the property that (i) 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\); (ii) if \(f(v)=1\), then vertex \(v ...
Akhoundi, Maryam, Khan, Aysha, Shafi, Jana, Volkmann, Lutz   +3 more
openaire   +1 more source

Covering total double Roman domination in graphs

2021
Summary: For a graph \(G\) with no isolated vertex, a covering total double Roman dominating function (CTDRD function) \(f\) of \(G\) is a total double Roman dominating function (TDRD function) of \(G\) for which the set \(\{v \in V(G)\mid f(v)\neq 0\}\) is a vertex cover set. The covering total double Roman domination number \(\gamma_{\mathrm{ctdR}}(G)
Teymourzadeh, Atieh, Mojdeh, Doost Ali
openaire   +1 more source

Bounds on the quasi total double Roman domination number in graphs

Discrete Mathematics, Algorithms and Applications (DMAA)
A quasi total double Roman dominating function (QTDRD-function) on a graph [Formula: see text] is a function [Formula: see text] having the property that (i) if [Formula: see text], then vertex [Formula: see text] must have at least two neighbors ...
J. Amjadi, S. Babaei, S. M. Sheikholeslami, M. Chellali, S. Kosari   +4 more
semanticscholar   +1 more source

Meta-heuristic Algorithms for Double Roman Domination Problem

Applied Soft Computing Journal
Himanshu Aggarwal, P. V. S. Reddy
semanticscholar   +3 more sources

Maximal double Roman domination in graphs

Applied Mathematics and Computation, 2022
A maximal double Roman dominating function (MDRDF) on a graph $G=(V,E)$ is a function $f:V(G)\rightarrow \{0,1,2,3\}$ such that \textrm{(i) }every vertex $v$ with $f(v)=0$ is adjacent to least two vertices { assigned $2$ or to at least one vertex ...
H. Ahangar, M. Chellali, S. Sheikholeslami, J. Valenzuela-Tripodoro   +3 more
semanticscholar   +1 more source

Algorithmic Framework for Double Roman Domination in Chemical Structures using Python

2025 3rd International Conference on Intelligent Cyber Physical Systems and Internet of Things (ICoICI)
This paper focuses on the double Roman domination number, a graph-theoretic parameter defined through the double Roman dominating function h : V → {0, 1, 2, 3}.
st J. Meena, N. M. Malini, D. Yoga, Pradeesh Kumar   +3 more
semanticscholar   +1 more source

The proposed algorithm is fast, lightweight, simple and offers a 2 factor protection to the data which makes it suitable for low resource devices.

Journal of Discrete Mathematical Sciences and Cryptography
In 2016, Beeler et al. [9] introduced the concept of the double Roman dominating function and the double Roman domination number(DRDN) of a graph. Following the same concept, we extend the study and calculate the double Roman domination number of the ...
Ravi P Kumar, Ashutosh Singh, Om Prakash
semanticscholar   +1 more source

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

Outer independent double Roman domination in unicyclic and bicyclic graphs

Ars Comb.
An outer independent double Roman dominating function (OIDRDF) of a graph \( G \) is a function \( f:V(G)\rightarrow\{0,1,2,3\} \) satisfying the following conditions: (i) every vertex \( v \) with \( f(v)=0 \) is adjacent to a vertex assigned 3 or at ...
S. Nazari-Moghaddam, M. Chellali, S. Sheikholeslami   +2 more
semanticscholar   +1 more source