Total Roman domination on the digraphs
Let D=(V,A)D=\left(V,A) be a simple digraph with vertex set VV, arc set AA, and no isolated vertex. A total Roman dominating function (TRDF) of DD is a function h:V→{0,1,2}h:V\to \left\{0,1,2\right\}, which satisfies that each vertex x∈Vx\in V with h(x)=0h\left(x)=0 has an in-neighbour y∈Vy\in V wit...
Main Authors: | Zhang Xinhong, Song Xin, Li Ruijuan |
---|---|
Format: | Article |
Language: | English |
Published: |
De Gruyter
2023-04-01
|
Series: | Open Mathematics |
Subjects: | |
Online Access: | https://doi.org/10.1515/math-2022-0575 |
Similar Items
-
Signed Total Roman Domination in Digraphs
by: Volkmann Lutz
Published: (2017-02-01) -
A Note on Roman Domination of Digraphs
by: Chen Xiaodan, et al.
Published: (2019-02-01) -
Bounds on the Signed Roman k-Domination Number of a Digraph
by: Chen Xiaodan, et al.
Published: (2019-02-01) -
On The Total Roman Domination in Trees
by: Amjadi Jafar, et al.
Published: (2019-05-01) -
Total Roman {2}-Dominating Functions in Graphs
by: Ahangar H. Abdollahzadeh, et al.
Published: (2022-08-01)