On The Total Roman Domination in Trees
A total Roman dominating function on a graph G is a function f : V (G) → {0, 1, 2} satisfying the following conditions: (i) every vertex u for which f(u) = 0 is adjacent to at least one vertex v for which f(v) = 2 and (ii) the subgraph of G induced by the set of all vertices of positive weight has n...
| প্রধান লেখক: | , , |
|---|---|
| বিন্যাস: | প্রবন্ধ |
| ভাষা: | English |
| প্রকাশিত: |
University of Zielona Góra
2019-05-01
|
| মালা: | Discussiones Mathematicae Graph Theory |
| বিষয়গুলি: | |
| অনলাইন ব্যবহার করুন: | https://doi.org/10.7151/dmgt.2099 |