Roman domination in oriented trees
<p class="p1">Let <em>D</em>=(<em>V,A</em>) be a digraph of order <em>n</em> = |<em>V</em>|. A <em>Roman dominating function</em> of a digraph <em>D</em> is a function <em>f</em> : <em>V </em...
Main Authors: | Lyes Ouldrabah, Mostafa Blidia, Ahmed Bouchou |
---|---|
Format: | Article |
Language: | English |
Published: |
Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia
2021-04-01
|
Series: | Electronic Journal of Graph Theory and Applications |
Subjects: | |
Online Access: | https://www.ejgta.org/index.php/ejgta/article/view/571 |
Similar Items
-
Extremal Graphs for a Bound on the Roman Domination Number
by: Bouchou Ahmed, et al.
Published: (2020-08-01) -
The Roman domination and domatic numbers of a digraph
by: Z.Xie1, et al.
Published: (2019-06-01) -
A note on k-Roman graphs
by: Ahmed Bouchou, et al.
Published: (2013-01-01) -
Quadruple Roman Domination in Trees
by: Zheng Kou, et al.
Published: (2021-07-01) -
Bounds on the Signed Roman k-Domination Number of a Digraph
by: Chen Xiaodan, et al.
Published: (2019-02-01)