Results 221 to 230 of about 48,400 (246)
Some of the next articles are maybe not open access.

An Upper Bound on the Total Roman { 2 } -domination Number of Graphs with Minimum Degree Two

Journal of Combinatorial Mathematics and Combinatorial Computing
A total Roman \(\{2\}\)-dominating function on a graph \(G = (V,E)\) is a function \(f:V\rightarrow\{0,1,2\}\) with the properties that (i) for every vertex \({v}\in V\) with \(f({v})=0\), \(f(N({v}))\ge2\) and (ii) the set of vertices with \(f({v})>0 ...
M. Kheibari   +3 more
semanticscholar   +1 more source

Improved Total Domination and Total Roman Domination in Unit Disk Graphs

arXiv.org
Let $G=(V, E)$ be a simple undirected graph with no isolated vertex. A set $D_t\subseteq V$ is a total dominating set of $G$ if $(i)$ $D_t$ is a dominating set, and $(ii)$ the set $D_t$ induces a subgraph with no isolated vertex. The total dominating set
Sasmita Rout, G. K. Das
semanticscholar   +1 more source

On the Complexity of Signed Roman Domination

arXiv.org
Given a graph $G = (V, E)$, a signed Roman dominating function is a function $f: V \rightarrow \{-1, 1, 2\}$ such that for every vertex $u \in V$: $\sum_{v \in N[u]} f(v) \geq 1$ and for every vertex $u \in V$ with $f(u) = -1$, there exists a vertex $v ...
Sangam Balchandar Reddy
semanticscholar   +1 more source

The signed total Roman domatic number of a digraph

Discret. Math. Algorithms Appl., 2018
J. Amjadi
semanticscholar   +1 more source

New bounds on the outer-independent total double Roman domination number

Discret. Math. Algorithms Appl., 2023
S. Sheikholeslami, L. Volkmann
semanticscholar   +1 more source

Outer independent signed double Roman domination

Journal of Applied Mathematics and Computing, 2021
Seyed Mahmoud Sheikholeslami
exaly  

Further Progress on the Total Roman $$\{2\}$$ { 2 } -Domination Number of Graphs

Bulletin of the Iranian Mathematical Society, 2021
H. Abdollahzadeh Ahangar   +3 more
semanticscholar   +1 more source

Home - About - Disclaimer - Privacy