| Naslov: | On Grundy total domination number in product graphs |
|---|
| Avtorji: | ID Brešar, Boštjan (Avtor)
ID Bujtás, Csilla (Avtor)
ID Dravec, Tanja (Avtor)
ID Klavžar, Sandi (Avtor)
ID Košmrlj, Gašper (Avtor)
ID Marc, Tilen (Avtor)
ID Patkós, Balázs (Avtor)
ID Tuza, Zsolt (Avtor)
ID Vizer, Máté (Avtor) |
|---|
| Datoteke: |  Bresar-2021-ON_GRUNDY_TOTAL_DOMINATION_NUMBER.pdf (248,02 KB)
MD5: 94E61B02DB6A4D4C042073CBAFB409B4
 https://doi.org/10.7151/dmgt
|
|---|
| Jezik: | Angleški jezik |
|---|
| Vrsta gradiva: | Znanstveno delo |
|---|
| Tipologija: | 1.01 - Izvirni znanstveni članek |
|---|
| Organizacija: | FNM - Fakulteta za naravoslovje in matematiko
|
|---|
| Opis: | A longest sequence (v1,....,vk) of vertices of a graph G is a Grundy total dominating sequence of G if for all i, N(vi)\U{j=1}^{i-1} N(vj)≠∅. The length k of the sequence is called the Grundy total domination number of G and denoted ɣ{gr}^{t}(G). In this paper, the Grundy total domination number is studied on four standard graph products. For the direct product we show that ɣ{gr}^{t}(G x H) > ɣ{gr}^{t}(G)ɣ{gr}^{t}(H), conjecture that the equality always holds, and prove the conjecture in several special cases. For the lexicographic product we express ɣ{gr}^{t}(G o H) in terms of related invariant of the factors and find some explicit formulas for it. For the strong product, lower bounds on ɣ{gr}^{t}(G ⊠ H) are proved as well as upper bounds for products of paths and cycles. For the Cartesian product we prove lower and upper bounds on the Grundy total domination number when factors are paths or cycles. |
|---|
| Ključne besede: | total domination, Grundy total domination number, graph product |
|---|
| Status publikacije: | Objavljeno |
|---|
| Verzija publikacije: | Objavljena publikacija |
|---|
| Poslano v recenzijo: | 27.02.2018 |
|---|
| Datum sprejetja članka: | 26.09.2018 |
|---|
| Datum objave: | 01.01.2021 |
|---|
| Založnik: | Technical University Press |
|---|
| Leto izida: | 2021 |
|---|
| Št. strani: | Str. 225-247 |
|---|
| Številčenje: | Letn. 41, Št. 1 |
|---|
| PID: | 20.500.12556/DKUM-89723  |
|---|
| UDK: | 519.17 |
|---|
| COBISS.SI-ID: | 36071939 |
|---|
| DOI: | 10.7151/dmgt.2184 |
|---|
| ISSN pri članku: | 1234-3099 |
|---|
| Datum objave v DKUM: | 07.08.2024 |
|---|
| Število ogledov: | 261 |
|---|
| Število prenosov: | 14 |
|---|
| Metapodatki: |    |
|---|
| Področja: | Ostalo
|
|---|
|
:
|
Kopiraj citat |
|---|
| | | | Skupna ocena: | (0 glasov) |
|---|
| Vaša ocena: | Ocenjevanje je dovoljeno samo prijavljenim uporabnikom. |
|---|
| Objavi na: |  |
|---|
Postavite miškin kazalec na naslov za izpis povzetka. Klik na naslov izpiše
podrobnosti ali sproži prenos. |
