Results 151 to 160 of about 706 (195)

Meta-Heuristic Algorithms for Quasi Total Double Roman Domination Problem

RAIRO - Theoretical Informatics and Applications
Ensuring the resilience and security of complex networks, such as communication or power grids, requires strategies that can withstand failures and attacks. One such approach involves the use of domination models in graph theory.
Charan Karnati, Alfred Raju M, Palagiri Venkata Subba Reddy   +2 more
semanticscholar   +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

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

Optimizing Communication in Complete Binary Trees Using Variant Double Roman Domination with Python-Based Pseudocode

2025 8th International Conference on Trends in Electronics and Informatics (ICOEI)
In modern communication networks and distributed computing, hierarchical structures like complete binary trees play a crucial role in ensuring efficient data transmission, fault tolerance, and resource allocation.
J. Meena, T. N. M. M. Mai
semanticscholar   +1 more source

Algorithmic Aspects of Outer-Independent Double Roman Domination in Graphs

International Journal of Foundations of Computer Science
Let [Formula: see text] be graph. For any function [Formula: see text], let [Formula: see text], [Formula: see text]. The function [Formula: see text] is called an outer-independent double Roman dominating function (OIDRDF) if the following conditions ...
Amit Sharma, P. V. S. Reddy, Subramanian Arumugam, J. P. Kumar   +3 more
semanticscholar   +1 more source

Double Roman Domination in Cartesian Product

Creative Mathematics and Informatics
Given a graph $G=(V,E)$, a function $f:V\rightarrow \{0,1,2,3\}$ having the property that if $f(v)=0$, then there exist $ v_{1},v_{2}\in N(v)$ such that $f(v_{1})=2=f(v_{2})$ or there exists $ w \in N(v)$ such that $f(w)=3$, and if $f(v)=1$, then there ...
V. Anu, L. Aparna
semanticscholar   +1 more source

Understanding the Electric Double-Layer Structure, Capacitance, and Charging Dynamics

Chemical Reviews, 2022
Jianzhong Wu
exaly  

Double Roman Domination in Digraphs

, 2019
Guoliang Hao, Xiaodan Chen, L. Volkmann
semanticscholar   +1 more source

Solving the minimum-cost double Roman domination problem

Central European Journal of Operations Research, 2023
Ana Klobučar Barišić, R. Manger
semanticscholar   +1 more source

Single-junction organic solar cells with over 19% efficiency enabled by a refined double-fibril network morphology

Nature Materials, 2022
Lei Zhu, Ming Zhang, Chao Li
exaly