Perfect Roman {3}-Domination in Graphs: Complexity and Bound of Perfect Roman {3}-Domination Number of Trees
A perfect Roman 3-dominating function on a graph G=V,E is a function f:V⟶0,1,2,3 having the property that if fv=0, then ∑u∈Nvfu=3, and if fv=1, then ∑u∈Nvfu=2 for any vertex v∈V. The weight of a perfect Roman 3-dominating function f is the sum ∑v∈Vfv. The perfect Roman 3-domination number of a graph...
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2024-01-01
|
| Series: | Journal of Mathematics |
| Online Access: | http://dx.doi.org/10.1155/jom/1900923 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!