New Bounds on the Triple Roman Domination Number of Graphs
In this paper, we derive sharp upper and lower bounds on the sum γ3RG+γ3RG¯ and product γ3RGγ3RG¯, where G¯ is the complement of graph G. We also show that for each tree T of order n≥2, γ3RT≤3n+sT/2 and γ3RT≥⌈4nT+2−ℓT/3⌉, where sT and ℓT are the number of support vertices and leaves of T....
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/9992618 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|