Results 41 to 50 of about 2,477,819 (60)

Double Roman domination

Discrete Applied Mathematics, 2016
For a graph G=(V,E), a double Roman dominating function is a function f:V→{0,1,2,3} having the property that if f(v)=0, then vertex v must have at least two neighbors assigned 2 under f or one neighbor with f(w)=3, and if f(v)=1, then vertex v must have ...
Teresa Haynes, Stephen T Hedetniemi
exaly   +2 more sources

Some of the next articles are maybe not open access.

Related searches:

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],
Akram Mahmoodi, Maryam Atapour, Sattar Aliyar   +2 more
openaire   +2 more sources

On the signed Roman k-domination in graphs

Quaestiones Mathematicae, 2020
Let k ≥ 1 be an integer and G be a simple and finite graph with vertex set V (G). A signed Roman k-dominating function (SRkDF) on a graph G is a function f : V (G) → {−1, 1, 2} such that (i) every vertex v with f(v) = −1 is adjacent to at least one ...
Lutz Volkmann, J Amjadi
exaly   +1 more source

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

Signed double Roman \(k\)-domination in graphs

Australas. J Comb., 2018
Summary: Let \(G=(V,E)\) be a simple and finite graph with vertex set \(V(G)\), and let \(k\geq 1\) be an integer. A signed double Roman \(k\)-dominating function (SDR\(k\)DF) on a graph \(G\) is a function \(f:V(G)\rightarrow \{-1,1,2,3\}\) such that (i) every vertex \(v\) with \(f(v)=-1\) is adjacent to at least two vertices assigned with 2 or to at ...
Jafar Amjadi, Hong Yang, Sakineh Nazari-Moghaddam, Seyed Mahmoud Sheikholeslami, Zehui Shao   +4 more
openaire   +2 more sources

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   +1 more source

On the signed Roman k-domination: Complexity and thin torus graphs

Discrete Applied Mathematics, 2017
Sandi Klavžar, Zehui Shao, Pu Wu
exaly  

Independent Signed Double Roman Domination

Advances in Applied Mathematics
openaire   +1 more source

Signed Roman domination in graphs

Journal of Combinatorial Optimization, 2012
Michael Henning, Yancai Zhao, H Abdollahzadeh Ahangar   +2 more
exaly  

On the signed total Roman domination and domatic numbers of graphs

Discrete Applied Mathematics, 2016
Lutz Volkmann
exaly