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: | , , |
|---|---|
| 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 |