Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2511.20367 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911286308110336 |
|---|---|
| author | Mann, Kevin |
| author_facet | Mann, Kevin |
| contents | Although Extension Perfect Roman Domination is NP-complete, all minimal (with respect to the pointwise order) perfect Roman dominating functions can be enumerated with polynomial delay. This algorithm uses a bijection between minimal perfect Roman dominating functions and Roman dominating functions and the fact that all minimal Roman dominating functions can be enumerated with polynomial delay. This bijection considers the set of vertices with value 2 under the functions. In this paper, we will generalize this idea by defining so called nice Roman Domination properties for which we can employ this method. With this idea, we can show that all minimal maximal Roman Dominating functions can be enumerated with polynomial delay in O(1.9332^n) time. Furthermore, we prove that enumerating all minimal connected/total Roman dominating functions on cobipartite graphs can be achieved with polynomial delay. Additionally, we show the existence of a polynomial-delay algorithm for enumerating all minimal connected Roman dominating function on interval graphs. We show some downsides to this method as well. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2511_20367 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Enumeration With Nice Roman Domination Properties Mann, Kevin Discrete Mathematics Computational Complexity Although Extension Perfect Roman Domination is NP-complete, all minimal (with respect to the pointwise order) perfect Roman dominating functions can be enumerated with polynomial delay. This algorithm uses a bijection between minimal perfect Roman dominating functions and Roman dominating functions and the fact that all minimal Roman dominating functions can be enumerated with polynomial delay. This bijection considers the set of vertices with value 2 under the functions. In this paper, we will generalize this idea by defining so called nice Roman Domination properties for which we can employ this method. With this idea, we can show that all minimal maximal Roman Dominating functions can be enumerated with polynomial delay in O(1.9332^n) time. Furthermore, we prove that enumerating all minimal connected/total Roman dominating functions on cobipartite graphs can be achieved with polynomial delay. Additionally, we show the existence of a polynomial-delay algorithm for enumerating all minimal connected Roman dominating function on interval graphs. We show some downsides to this method as well. |
| title | Enumeration With Nice Roman Domination Properties |
| topic | Discrete Mathematics Computational Complexity |
| url | https://arxiv.org/abs/2511.20367 |