Results 241 to 250 of about 53,396 (255)
Some of the next articles are maybe not open access.
Twin signed total Roman domination numbers in digraphs
Asian-European Journal of Mathematics, 2018Let [Formula: see text] be a finite simple digraph with vertex set [Formula: see text] and arc set [Formula: see text]. A twin signed total Roman dominating function (TSTRDF) on the digraph [Formula: see text] is a function [Formula: see text] satisfying the conditions that (i) [Formula: see text] and [Formula: see text] for each [Formula: see text ...
Amjadi, J., Soroudi, M.
openaire +2 more sources
On the signed Roman k-domination in graphs
Quaestiones Mathematicae, 2019Let 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 vertex u with f(u) = 2, (ii) ∑ u∈N[v] f(u) ≥ k holds for any vertex v.
J. Amjadi +3 more
openaire +1 more source
Signed roman star edge dominance of graphs
AIP Conference Proceedings, 2023Angshu Kumar Sinha, Akul Rana, Anita Pal
openaire +1 more source
On the signed Roman k-domination in graphs
Quaestiones Mathematicae, 2020S M Sheikholeslami, Lutz Volkmann
exaly
The Signed Roman Domination Number of a Special Graph
Pure Mathematics, 2021openaire +1 more source
Signed total Roman domination in graphs
Journal of Combinatorial Optimization, 2015Lutz Volkmann
exaly
On the signed Roman k-domination: Complexity and thin torus graphs
Discrete Applied Mathematics, 2017Zehui Shao, Sandi Klavzar, Zepeng Li
exaly
Signed Roman k-domination in trees
Discrete Applied Mathematics, 2015Michael A Henning, Lutz Volkmann
exaly
Signed total Roman domination and domatic numbers in graphs
Applied Mathematics and ComputationYubao Guo, Lutz Volkmann, Yun Wang 0042
openaire +2 more sources