The Perfect Roman Domination Number of the Cartesian Product of Some Graphs
A perfect Roman dominating function on a graph G is a function f:VG⟶0,1,2 for which every vertex v with fv=0 is adjacent to exactly one neighbor u with fu=2. The weight of f is the sum of the weights of the vertices. The perfect Roman domination number of a graph G, denoted by γRpG, is the minimum w...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2022-01-01
|
| Series: | Journal of Mathematics |
| Online Access: | http://dx.doi.org/10.1155/2022/1957027 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|