Results 221 to 229 of about 1,161 (229)

Edge Criticality in Signed Graphs Admitting a Roman Dominating Function

Art of Discrete and Applied Mathematics
Mayamma Joseph
exaly   +2 more sources

Enhancing Network Security in Distributed Systems Using Middle Roman Dominating Functions

Communications on Applied Nonlinear Analysis
A Middle Roman dominating function (MRDN) on a graph G = (V,E) is a function f:v→{0,1,2,3} satisfying the condition that every vertex u with f(u)=0 is adjacent to at most one vertex v with f(v)=2 or 3. Further if a vertex is assigned 2, then at most two of its vertices can be assigned 0 and if a vertex is assigned 3, then all its neighbours can be ...
exaly   +2 more sources

Algorithmic Results in Roman Dominating Functions on Graphs

Information Processing Letters, 2023
Abolfazl Poureidi, Jafar Fathali
exaly  

Nearly Tight Approximation Algorithm for (Connected) Roman Dominating Set

Optimization Letters, 2022
Ding-Zhu Du, Zhao Zhang, Yingli Ran
exaly  

Outer-Independent Signed Roman Domination Function in Graphs

Operations Research Forum
Ning Li, Peng Li, Jianhui Shang
openaire   +2 more sources

Signed Total Roman Dominating Functions of Corona Product of a Path with a Complete Graph

International Journal of Mathematics Trends and Technology, 2017
C. Shobha Rani, S. Jeelani Begum, G.S.S Raju, S.Gouse Mohiddin   +3 more
openaire   +1 more source

Total Signed And Roman Edge Dominating Functions of Corona Product Graph of A Cycle With A Complete Graph

International Journal of Mathematics Trends and Technology, 2019
Anitha J, Maheswari B
openaire   +1 more source

Minimal Roman Dominating Functions: Extensions and Enumeration

Algorithmica
Faisal N Abu-Khzam, Henning Fernau, Kevin Mann   +2 more
exaly