Results 1 to 10 of about 437 (67)
Signed Total Roman Edge Domination In Graphs
Discussiones Mathematicae Graph Theory, 2017 Let G = (V,E) be a simple graph with vertex set V and edge set E. A signed total Roman edge dominating function of G is a function f : Ʃ → {−1, 1, 2} satisfying the conditions that (i) Ʃe′∈N(e) f(e′) ≥ 1 for each e ∈ E, where N(e) is the open ...
L. Asgharsharghi, S. Sheikholeslami
semanticscholar +2 more sources
On the Quasi-Total Roman Domination Number of Graphs
Mathematics, 2021 Domination theory is a well-established topic in graph theory, as well as one of the most active research areas. Interest in this area is partly explained by its diversity of applications to real-world problems, such as facility location problems ...
Abel Cabrera Martínez +2 more
semanticscholar +1 more source
Complexity of signed total $k$-Roman domination problem in graphs
, 2020 Let $G$ be a simple graph with finite vertex set $V(G)$ and $S=\{-1,1,2\}$. A signed total Roman $k$-dominating function (STRkDF) on a graph $G$ is a function $f:V(G)\to S$ such that (i) any vertex $y$ with $f(y)=-1$ is adjacent to at least one vertex $t$
S. Kosari +4 more
semanticscholar +1 more source
Total Roman domination on the digraphs
Open Mathematics, 2023 Let D = ( V , A ) D=\left(V,A) be a simple digraph with vertex set V V , arc set A A , and no isolated vertex. A total Roman dominating function (TRDF) of D D is a function h : V → { 0 , 1 , 2 } h:V\to \left\{0,1,2\right\} , which satisfies that each ...
Xinhong Zhang, Xin Song, Ruijuan Li
semanticscholar +1 more source
On the (total) Roman domination in Latin square graphs
AIMS Mathematics, 2023 Latin square, also known as Latin square matrix, refers to a kind of $ n\times n $ matrix, in which there are exactly $ n $ different symbols and each symbol appears exactly once in each row and column.
Chang-Xu Zhang +2 more
semanticscholar +1 more source
Bounds on the Total Double Roman Domination Number of Graphs
Discussiones Mathematicae Graph Theory, 2021 Let G be a simple graph with no isolated vertex and let γtdR(G) be the total double Roman domination number of G. In this paper, we present lower and upper bounds on γtdR (G) of a graph G in terms of the order, open packing number and the numbers of ...
Guoliang Hao +3 more
semanticscholar +1 more source
Total Roman Domination Number of Rooted Product Graphs
, 2020 Let G be a graph with no isolated vertex and f:V(G)→{0,1,2} a function. If f satisfies that every vertex in the set {v∈V(G):f(v)=0} is adjacent to at least one vertex in the set {v∈V(G):f(v)=2}, and if the subgraph induced by the set {v∈V(G):f(v)≥1} has ...
A. Cabrera Martínez +3 more
semanticscholar +1 more source
Twin signed total Roman domination numbers in digraphs
Asian-European Journal of Mathematics, 2018 Let [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.
semanticscholar +4 more sources
Some of the next articles are maybe not open access.
Signed total Roman domination and domatic numbers in graphs
Applied Mathematics and ComputationYubao Guo, Lutz Volkmann, Yun Wang 0042
openaire +3 more sources
Signed total Roman domination in graphs
Journal of Combinatorial Optimization, 2015Lutz Volkmann, Volkmann Lutz
exaly +2 more sources