Total Roman {3}-domination in Graphs
For a graph <inline-formula> <math display="inline"> <semantics> <mrow> <mi>G</mi> <mo>=</mo> <mo>(</mo> <mi>V</mi> <mo>,</mo> <mi>E</mi> <mo>)</mo> </mrow> </semantics>...
Main Authors: | Zehui Shao, Doost Ali Mojdeh, Lutz Volkmann |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2020-02-01
|
Series: | Symmetry |
Subjects: | |
Online Access: | https://www.mdpi.com/2073-8994/12/2/268 |
Similar Items
-
Total double Roman domination in graphs
by: Guoliang Hao, et al.
Published: (2020-06-01) -
On the Quasi-Total Roman Domination Number of Graphs
by: Abel Cabrera Martínez, et al.
Published: (2021-11-01) -
Further Results on the Total Roman Domination in Graphs
by: Abel Cabrera Martínez, et al.
Published: (2020-03-01) -
Weak signed Roman domination in graphs
by: Lutz Volkmann
Published: (2020-12-01) -
On The Co-Roman Domination in Graphs
by: Shao Zehui, et al.
Published: (2019-05-01)