| Naslov: | Complexity of 2-rainbow total domination problem |
|---|
| Avtorji: | ID Kraner Šumenjak, Tadeja (Avtor)
ID Tepeh, Aleksandra (Avtor) |
|---|
| Datoteke: |  PDF - Predstavitvena datoteka, prenos (391,20 KB)
MD5: 22D44F33D85AFC2D4B25C054EC78E837
 URL - Izvorni URL, za dostop obiščite https://link.springer.com/article/10.1007/s40840-024-01747-8
|
|---|
| Jezik: | Angleški jezik |
|---|
| Tipologija: | 1.01 - Izvirni znanstveni članek |
|---|
| Organizacija: |  IMFM - Inštitut za matematiko, fiziko in mehaniko
|
|---|
| Povzetek: | 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. |
|---|
| Ključne besede: | domination, rainbow domination, rooted product, NP-complete |
|---|
| Status publikacije: | Objavljeno |
|---|
| Verzija publikacije: | Objavljena publikacija |
|---|
| Datum objave: | 01.09.2024 |
|---|
| Leto izida: | 2024 |
|---|
| Št. strani: | 12 str. |
|---|
| Številčenje: | Vol. 47, iss. 5, article no. 155 |
|---|
| PID: | 20.500.12556/DiRROS-20226  |
|---|
| UDK: | 519.17 |
|---|
| ISSN pri članku: | 0126-6705 |
|---|
| DOI: | 10.1007/s40840-024-01747-8 |
|---|
| COBISS.SI-ID: | 204512515 |
|---|
| Opomba: |
|
|---|
| Datum objave v DiRROS: | 26.08.2024 |
|---|
| Število ogledov: | 3 |
|---|
| Število prenosov: | 0 |
|---|
| Metapodatki: |     |
|---|
|
:
|
Kopiraj citat |
|---|
| | | | Objavi na: |  |
|---|
Postavite miškin kazalec na naslov za izpis povzetka. Klik na naslov izpiše
podrobnosti ali sproži prenos. |
