| Title: | Complexity of 2-rainbow total domination problem |
|---|
| Authors: | ID Kraner Šumenjak, Tadeja (Author)
ID Tepeh, Aleksandra (Author) |
|---|
| Files: |  PDF - Presentation file, download (391,20 KB)
MD5: 22D44F33D85AFC2D4B25C054EC78E837
 URL - Source URL, visit https://link.springer.com/article/10.1007/s40840-024-01747-8
|
|---|
| Language: | English |
|---|
| Typology: | 1.01 - Original Scientific Article |
|---|
| Organization: |  IMFM - Institute of Mathematics, Physics, and Mechanics
|
|---|
| Abstract: | In this paper,we extend the findings of recent studies on $k$-rainbow total domination by placing our focus on its computational complexity aspects. We show that the problem of determining whether a graph has a $2$-rainbow total dominating function of a given weight is NP-complete. This complexity result holds even when restricted to planar graphs. Along the way tight bounds for the $k$-rainbow total domination number of rooted product graphs are established. In addition, we obtain the closed formula for the $k$-rainbow total domination number of the corona product $G ∗ H$, provided that $H$ has enough vertices. |
|---|
| Keywords: | domination, rainbow domination, rooted product, NP-complete |
|---|
| Publication status: | Published |
|---|
| Publication version: | Version of Record |
|---|
| Publication date: | 01.09.2024 |
|---|
| Year of publishing: | 2024 |
|---|
| Number of pages: | 12 str. |
|---|
| Numbering: | Vol. 47, iss. 5, article no. 155 |
|---|
| PID: | 20.500.12556/DiRROS-20226  |
|---|
| UDC: | 519.17 |
|---|
| ISSN on article: | 0126-6705 |
|---|
| DOI: | 10.1007/s40840-024-01747-8 |
|---|
| COBISS.SI-ID: | 204512515 |
|---|
| Note: |
|
|---|
| Publication date in DiRROS: | 26.08.2024 |
|---|
| Views: | 5 |
|---|
| Downloads: | 0 |
|---|
| Metadata: |     |
|---|
|
:
|
Copy citation |
|---|
| | | | Share: |  |
|---|
Hover the mouse pointer over a document title to show the abstract or click
on the title to get all document metadata. |
