| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Show document Help

Title:On Grundy total domination number in product graphs
Authors:ID Brešar, Boštjan (Author)
ID Bujtás, Csilla (Author)
ID Dravec, Tanja (Author)
ID Klavžar, Sandi (Author)
ID Košmrlj, Gašper (Author)
ID Marc, Tilen (Author)
ID Patkós, Balázs (Author)
ID Tuza, Zsolt (Author)
ID Vizer, Máté (Author)
Files:.pdf Bresar-2021-ON_GRUNDY_TOTAL_DOMINATION_NUMBER.pdf (248,02 KB)
MD5: 94E61B02DB6A4D4C042073CBAFB409B4
 
URL https://doi.org/10.7151/dmgt
 
Language:English
Work type:Scientific work
Typology:1.01 - Original Scientific Article
Organization:FNM - Faculty of Natural Sciences and Mathematics
Abstract: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.
Keywords:total domination, Grundy total domination number, graph product
Publication status:Published
Publication version:Version of Record
Submitted for review:27.02.2018
Article acceptance date:26.09.2018
Publication date:01.01.2021
Publisher:Technical University Press
Year of publishing:2021
Number of pages:Str. 225-247
Numbering:Letn. 41, Št. 1
PID:20.500.12556/DKUM-89723 New window
UDC:519.17
ISSN on article:1234-3099
COBISS.SI-ID:36071939 New window
DOI:10.7151/dmgt.2184 New window
Publication date in DKUM:07.08.2024
Views:258
Downloads:14
Metadata:XML DC-XML DC-RDF
Categories:Misc.
:
Copy citation
  
Average score:(0 votes)
Your score:Voting is allowed only for logged in users.
Share:Bookmark and Share



Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Record is a part of a journal

Title:Discussiones mathematicae. Graph theory
Shortened title:Discuss. Math., Graph Theory
Publisher:Technical University Press
ISSN:1234-3099
COBISS.SI-ID:7487065 New window

Document is financed by a project

Funder:Other - Other funder or multiple funders
Project number:SNN 116095

Funder:ARRS - Slovenian Research Agency
Project number:N1-0043
Name:Kombinatorični problemi s poudarkom na igrah

Funder:ARRS - Slovenian Research Agency
Project number:J1-7110
Name:RAZISKOVANJE NOTRANJE STRUKTURE STOLPNIH GRAFOV

Funder:ARRS - Slovenian Research Agency
Project number:J1-9019

Funder:ARRS - Slovenian Research Agency
Project number:P1-0297
Name:Teorija grafov

Funder:ARRS - Slovenian Research Agency
Project number:P1-0294
Name:Računsko intenzivne metode v teoretičnem računalništvu, diskretni matematiki, kombinatorični optimizaciji ter numerični analizi in algebri z uporabo v naravoslovju in družboslovju

Funder:Other - Other funder or multiple funders
Project number:KKIPP-99/2017

Licences

License:CC BY-NC-ND 4.0, Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
Link:http://creativecommons.org/licenses/by-nc-nd/4.0/
Description:The most restrictive Creative Commons license. This only allows people to download and share the work for no commercial gain and for no other purposes.
Licensing start date:01.01.2021

Secondary language

Language:Slovenian
Title:O Grundyjevem celotnem dominantnem številu produktih grafov
Abstract:Najdaljše zaporedje (v1,....,vk) vozlišč grafa G je Grundyjevo celotno dominantno zaporedje, če za vse i velja N(vi)\U{j=1}^{i-1} N(vj)≠∅. Dolžina k takega zaporedja je Grundyjevo celotno dominantno število grafa G in se uznačuje z ɣ{gr}^{t}(G). V tem članku je Grundyjevo celotno dominantno števijo študirano na štirih standardnih produktih grafov. Za direktni produkt je dokazano, da velja ɣ{gr}^{t}(G x H) > ɣ{gr}^{t}(G)ɣ{gr}^{t}(H). Postavljena je domneva, da vedno velja enakost. Domneva je dokazana v več posebnih primerih. Za leksikografski produkt je vrednost ɣ{gr}^{t}(G o H) izražena z ustreznimi invariantami faktorjev, poiskanih je tudi nekaj eksplicitnih formul. Za krepki produkt so dokazane spodnje meja za ɣ{gr}^{t}(G ⊠ H) in tudi zgornje meje za produkte poti in ciklov. Za kartezični produkt pa so dokazane spodnje in zgornje meje za primer, ko so faktorji poti ali cikli.
Keywords:celotna dominacija, Grundyjevo celotno dominantno število, produkt grafov


Comments

Leave comment

You must log in to leave a comment.

Comments (0)
0 - 0 / 0
 
There are no comments!

Back
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica