2 citations · 2 across the 4 of their papers we have counts for
7 papers · 1 filter
Signed Total Roman Domination and Domatic Numbers: Degree Three and Complete Multipartite Graphs
Arie M. C. A. Koster, Lutz Volkmann, Moritz Wehrmann
Signed total Roman domination is a variant of the classic Roman domination-problem in graphs. A signed total Roman dominating function (STRD function) on a graph is a fun…
A Characterization of -Free Irredundance Perfect Graphs
Vadim Zverovich, Pavel Skums, Lutz Volkmann
Let and be the irredundance number and the domination number of a graph , respectively. A graph is called irredundance perfect if for every induc…
On the total Italian domination number in digraphs
Changchang Dong, Yubao Guo, Mei Lu +1
Consider a finite simple digraph with vertex set . An Italian dominating function (IDF) on is a function satisfying every vertex with…
Restrained double Roman domination of a graph
Doost Ali Mojdeh, Iman Masoumi, Lutz Volkmann
For a graph G=(V,E), a restrained double Roman dominating function is a function f:V\rightarrow\{0,1,2,3\} having the property that if f(v)=0, then the vertex v must have at least…
The Roman (k,k)-domatic number of a graph
A. P. Kazemi, S. M. Sheikholeslami, L. Volkmann
Let be a positive integer. A {\em Roman -dominating function} on a graph is a labeling such that every vertex with label 0 has at le…
Bounds on the nonnegative signed domination number of graphs
Doost Ali Mojdeh, Babak Samadi, Lutz Volkmann
The aim of this work is to investigate the nonnegative signed domination number with emphasis on regular, ()-clique-free graphs and trees. We give lower and upper b…