Results 141 to 150 of about 706 (195)

Outer independent signed double Roman domination

Journal of Applied Mathematics and Computing, 2021
Suppose $$[3]=\{0,1,2,3\}$$ and $$[3^{-}]=\{-1,1,2,3\}$$ . An outer independent signed double Roman dominating function (OISDRDF) of a graph
H. Abdollahzadeh Ahangar, F. Nahani Pour, Mustapha Chellali, Seyed Mahmoud Sheikholeslami   +3 more
semanticscholar   +3 more sources

Twin signed double Roman domination numbers in directed graphs

Discrete Mathematics, Algorithms and Applications, 2022
Let [Formula: see text] be a finite simple directed graph (shortly digraph). A function [Formula: see text] is called a twin signed double Roman dominating function (TSDRDF) if (i) every vertex [Formula: see text] with [Formula: see text] has at least two in-neighbor assigned a 2 or at least an in-neighbor [Formula: see text] with [Formula: see text],
A. Mahmoodi, Maryam Atapour, Sattar Aliyar   +2 more
semanticscholar   +4 more sources

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, H. Abdollahzadeh Ahangar, R. Khoeilar, Seyed Mahmoud Sheikholeslami   +3 more
semanticscholar   +3 more sources

Independent Signed Double Roman Domination

Advances in Applied Mathematics
柠 李
semanticscholar   +3 more sources

Some of the next articles are maybe not open access.

Related searches:

On the Outer Independent Total Double Roman Domination in Graphs

Mediterranean Journal of Mathematics, 2023
A double Roman dominating function (DRDF) on a graph $$G=(V,E)$$ G = ( V , E ) is a function $$f:V\rightarrow \{0,1,2,3\}$$ f : V → { 0 , 1 , 2 , 3 } satisfying (i) if $$f(v)=0$$ f ( v ) = 0 , then there must be at least two neighbors assigned 2 under f ...
H. Ahangar, M. Chellali, S. Sheikholeslami, J. Valenzuela-Tripodoro   +3 more
semanticscholar   +1 more source

Inverse double Roman domination in graphs

Discret. Math. Algorithms Appl., 2022
For a graph [Formula: see text], a double Roman dominating function (DRDF) is a function [Formula: see text] such that each vertex [Formula: see text] with [Formula: see text] is adjacent to at least two vertices labeled [Formula: see text] or one vertex
Wilma Laveena D' Souza, V. Chaitra, M. Kumara   +2 more
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

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