Digital repository of Slovenian research organisations

Show document
A+ | A- | Help | SLO | ENG

Title:Graphs with unique Grundy dominating sets
Authors:ID Brešar, Boštjan (Author)
ID Dravec, Tanja (Author)
Files:.pdf PDF - Presentation file, download (490,32 KB)
MD5: 53C31C2235052FCEC0F49EC3030776E8
 
URL URL - Source URL, visit https://link.springer.com/article/10.1007/s40314-026-03835-w
 
Language:English
Typology:1.01 - Original Scientific Article
Organization:Logo IMFM - Institute of Mathematics, Physics, and Mechanics
Abstract:Given a graph $G$ consider a procedure of building a dominating set $D$ in $G$ by adding vertices to $D$ one at a time in such a way that whenever vertex $x$ is added to $D$ there exists a vertex $y\in N_G[x]$ that becomes dominated only after $x$ is added to $D$. The maximum cardinality of a set $D$ obtained in the described way is called the Grundy domination number of $G$ and $D$ a Grundy dominating set. While a Grundy dominating set of a connected graph $G$ is not unique unless $G$ is the trivial graph, we consider a natural weaker uniqueness condition, notably that for every two Grundy dominating sets in a graph $G$ there is an automorphism that maps one to the other. We investigate both versions of uniqueness for several concepts of Grundy domination, which appeared in the context of domination games and are also closely related to zero forcing. For each of the four variations of Grundy domination we characterize the graphs that have only one Grundy dominating set of the given type, and characterize those forests that enjoy the weaker (isomorphism based) condition of uniqueness. The latter characterizations lead to efficient algorithms for recognizing the corresponding classes of forests.
Keywords:Grundy total domination number, Grundy domination number, zero forcing number, trees, graph automorphism
Publication status:Published
Publication version:Version of Record
Publication date:01.12.2026
Year of publishing:2026
Number of pages:20 str.
Numbering:Vol. 45, iss. 10, article no. 444
PID:20.500.12556/DiRROS-30350 New window
UDC:519.17
ISSN on article:2238-3603
DOI:10.1007/s40314-026-03835-w New window
COBISS.SI-ID:282411011 New window
Note:
Publication date in DiRROS:22.06.2026
Views:22
Downloads:13
Metadata:XML DC-XML DC-RDF
:
Copy citation
  
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:Computational & Applied Mathematics
Shortened title:Comput. Appl. Math.
Publisher:Sociedade Brasileira de Matemática Aplicada e Computacional.
ISSN:2238-3603
COBISS.SI-ID:73925379 New window

Document is financed by a project

Funder:ARIS - Slovenian Research and Innovation Agency
Project number:P1-0297
Name:Teorija grafov

Funder:ARIS - Slovenian Research and Innovation Agency
Project number:N1-0285
Name:Metrični problemi v grafih in hipergrafih

Funder:ARIS - Slovenian Research and Innovation Agency
Project number:J1-4008
Name:Drevesno neodvisnostno število grafov

Licences

License:CC BY 4.0, Creative Commons Attribution 4.0 International
Link:http://creativecommons.org/licenses/by/4.0/
Description:This is the standard Creative Commons license that gives others maximum freedom to do what they want with the work as long as they credit the author.

Secondary language

Language:Slovenian
Keywords:Grundyjevo celotno dominacijsko število, Grundyjevo dominacijsko število, število ničelne prisile, drevesa, avtomorfizem grafa


Back