{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,20]],"date-time":"2026-06-20T11:51:40Z","timestamp":1781956300130,"version":"3.54.5"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2026,6,20]],"date-time":"2026-06-20T00:00:00Z","timestamp":1781913600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2026,6,20]],"date-time":"2026-06-20T00:00:00Z","timestamp":1781913600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100004329","name":"Javna Agencija za Raziskovalno Dejavnost RS","doi-asserted-by":"publisher","award":["P1-0297"],"award-info":[{"award-number":["P1-0297"]}],"id":[{"id":"10.13039\/501100004329","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comp. Appl. Math."],"published-print":{"date-parts":[[2026,12]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>\n                    Given a graph\n                    <jats:italic>G<\/jats:italic>\n                    consider a procedure of building a dominating set\n                    <jats:italic>D<\/jats:italic>\n                    in\n                    <jats:italic>G<\/jats:italic>\n                    by adding vertices to\n                    <jats:italic>D<\/jats:italic>\n                    one at a time in such a way that whenever vertex\n                    <jats:italic>x<\/jats:italic>\n                    is added to\n                    <jats:italic>D<\/jats:italic>\n                    there exists a vertex\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$$y\\in N_G[x]$$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:mrow>\n                            <mml:mi>y<\/mml:mi>\n                            <mml:mo>\u2208<\/mml:mo>\n                            <mml:msub>\n                              <mml:mi>N<\/mml:mi>\n                              <mml:mi>G<\/mml:mi>\n                            <\/mml:msub>\n                            <mml:mrow>\n                              <mml:mo>[<\/mml:mo>\n                              <mml:mi>x<\/mml:mi>\n                              <mml:mo>]<\/mml:mo>\n                            <\/mml:mrow>\n                          <\/mml:mrow>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    that becomes dominated only after\n                    <jats:italic>x<\/jats:italic>\n                    is added to\n                    <jats:italic>D<\/jats:italic>\n                    . The maximum cardinality of a set\n                    <jats:italic>D<\/jats:italic>\n                    obtained in the described way is called the Grundy domination number of\n                    <jats:italic>G<\/jats:italic>\n                    and\n                    <jats:italic>D<\/jats:italic>\n                    a Grundy dominating set. While a Grundy dominating set of a connected graph\n                    <jats:italic>G<\/jats:italic>\n                    is not unique unless\n                    <jats:italic>G<\/jats:italic>\n                    is the trivial graph, we consider a natural weaker uniqueness condition, notably that for every two Grundy dominating sets in a graph\n                    <jats:italic>G<\/jats:italic>\n                    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.\n                  <\/jats:p>","DOI":"10.1007\/s40314-026-03835-w","type":"journal-article","created":{"date-parts":[[2026,6,20]],"date-time":"2026-06-20T11:29:53Z","timestamp":1781954993000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Graphs with unique Grundy dominating sets"],"prefix":"10.1007","volume":"45","author":[{"given":"Bo\u0161tjan","family":"Bre\u0161ar","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0540-0938","authenticated-orcid":false,"given":"Tanja","family":"Dravec","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,20]]},"reference":[{"key":"3835_CR1","volume-title":"The design and analysis of computer algorithms","author":"AV Aho","year":"1975","unstructured":"Aho AV, Hopcroft JE, Ullman JD (1975) The design and analysis of computer algorithms. Addison-Wesley Publishing Co., Reading"},{"key":"3835_CR2","doi-asserted-by":"publisher","first-page":"1628","DOI":"10.1016\/j.laa.2007.10.009","volume":"428","author":"AIM Minimum Rank-Special Graphs Work Group","year":"2008","unstructured":"AIM Minimum Rank-Special Graphs Work Group (2008) Zero forcing sets and the minimum rank of graphs. Linear Algebra Appl 428:1628\u20131648. https:\/\/doi.org\/10.1016\/j.laa.2007.10.009","journal-title":"Linear Algebra Appl"},{"key":"3835_CR3","doi-asserted-by":"publisher","first-page":"934","DOI":"10.1016\/j.disc.2018.11.025","volume":"342","author":"JD Alvarado","year":"2019","unstructured":"Alvarado JD, Dantas S, Mohr E, Rautenbach D (2019) On the maximum number of minimum dominating sets in forests. Discret Math 342:934\u201394. https:\/\/doi.org\/10.1016\/j.disc.2018.11.025","journal-title":"Discret Math"},{"key":"3835_CR4","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2021.112492","volume":"334","author":"S Bahad\u0131r","year":"2021","unstructured":"Bahad\u0131r S, G\u00f6z\u00fcpek D, Do\u011fan O (2021) On graphs whose all total dominating sequences have the same length. Discret Math 334:112492. https:\/\/doi.org\/10.1016\/j.disc.2021.112492","journal-title":"Discret Math"},{"key":"3835_CR5","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1016\/j.laa.2010.03.008","volume":"433","author":"F Barioli","year":"2010","unstructured":"Barioli F, Barrett W, Fallat SM, Hall HT, Hogben L, Shader B, van den Driessche P, van der Holst H (2010) Zero forcing parameters and minimum rank problems. Linear Algebra Appl 433:401\u2013411. https:\/\/doi.org\/10.1016\/j.laa.2010.03.008","journal-title":"Linear Algebra Appl"},{"key":"3835_CR6","doi-asserted-by":"publisher","first-page":"779","DOI":"10.7151\/dmgt.2304","volume":"42","author":"D Bo\u017eovi\u0107","year":"2022","unstructured":"Bo\u017eovi\u0107 D, Peterin I (2022) Graphs with unique maximum packing of closed neighborhoods. Discuss Math Graph Theory 42:779\u2013797","journal-title":"Discuss Math Graph Theory"},{"key":"3835_CR7","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/j.disc.2014.07.016","volume":"336","author":"B Bre\u0161ar","year":"2014","unstructured":"Bre\u0161ar B, Gologranc T, Milani\u010d M, Rall DF, Rizzi R (2014) Dominating sequences in graphs. Discret Math 336:22\u201336. https:\/\/doi.org\/10.1016\/j.disc.2014.07.016","journal-title":"Discret Math"},{"key":"3835_CR8","doi-asserted-by":"publisher","first-page":"1665","DOI":"10.1016\/j.disc.2016.01.017","volume":"339","author":"B Bre\u0161ar","year":"2016","unstructured":"Bre\u0161ar B, Henning MA, Rall DF (2016) Total dominating sequences in graphs. Discret Math 339:1665\u20131676. https:\/\/doi.org\/10.1016\/j.disc.2016.01.017","journal-title":"Discret Math"},{"key":"3835_CR9","doi-asserted-by":"publisher","unstructured":"Bre\u0161ar B, Bujt\u00e1s Cs, Gologranc T, Klav\u017ear S, Ko\u0161mrlj G, Patk\u00f3s B, Tuza Zs, Vizer M (2017) Grundy dominating sequences and zero forcing sets. Discret Optim 26:66\u201377. https:\/\/doi.org\/10.1016\/j.disopt.2017.07.001","DOI":"10.1016\/j.disopt.2017.07.001"},{"key":"3835_CR10","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1016\/j.disopt.2017.10.002","volume":"28","author":"B Bre\u0161ar","year":"2018","unstructured":"Bre\u0161ar B, Kos T, Nasini G, Torres P (2018) Total dominating sequences in trees, split graphs, and under modular decomposition. Discret Optim 28:16\u201330. https:\/\/doi.org\/10.1016\/j.disopt.2017.10.002","journal-title":"Discret Optim"},{"key":"3835_CR11","first-page":"37","volume":"5","author":"B Bre\u0161ar","year":"2019","unstructured":"Bre\u0161ar B, Kuenzel K, Rall D (2019) Graphs with a unique maximum open packing, Indian. J Discret Math 5:37\u201355","journal-title":"J Discret Math"},{"key":"3835_CR12","doi-asserted-by":"publisher","first-page":"3205","DOI":"10.2298\/FIL2010205B","volume":"34","author":"B Bre\u0161ar","year":"2020","unstructured":"Bre\u0161ar B, Gologranc T, Henning M, Kos T (2020) On the L-Grundy domination number of a graph. Filomat 34:3205\u20133215. https:\/\/doi.org\/10.2298\/FIL2010205B","journal-title":"Filomat"},{"key":"3835_CR13","doi-asserted-by":"crossref","unstructured":"Bre\u0161ar B, Henning MA, Klav\u017ear S, Rall DF (2021) Domination games played on graphs. SpringerBriefs in mathematics (in press)","DOI":"10.1007\/978-3-030-69087-8"},{"key":"3835_CR14","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1016\/j.dam.2018.04.015","volume":"250","author":"R Davila","year":"2018","unstructured":"Davila R, Kalinowski T, Stephen S (2018) A lower bound on the zero forcing number. Discret Appl Math 250:363\u2013367","journal-title":"Discret Appl Math"},{"key":"3835_CR15","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/s00010-021-00776-z","volume":"96","author":"T Dravec","year":"2022","unstructured":"Dravec T, Kos T, Jakovac M, Marc T (2022) On graphs with equal total domination and Grundy total domination number. Aequat Math 96:137\u2013144. https:\/\/doi.org\/10.1007\/s00010-021-00776-z","journal-title":"Aequat Math"},{"key":"3835_CR16","doi-asserted-by":"publisher","first-page":"4352","DOI":"10.1016\/j.laa.2010.10.015","volume":"436","author":"CJ Edholm","year":"2012","unstructured":"Edholm CJ, Hogben L, Huynh M, LaGrange J, Row D (2012) Vertex and edge spread of zero forcing number, maximum nullity, and minimum rank of a graph. Linear Algebra Appl 436:4352\u20134372","journal-title":"Linear Algebra Appl"},{"key":"3835_CR17","doi-asserted-by":"publisher","first-page":"1819","DOI":"10.1007\/s00373-020-02221-5","volume":"36","author":"A Erey","year":"2020","unstructured":"Erey A (2020) Uniform length dominating sequence graphs. Graphs Combin 36:1819\u20131825. https:\/\/doi.org\/10.1007\/s00373-020-02221-5","journal-title":"Graphs Combin"},{"key":"3835_CR18","unstructured":"Geneson J, Haas R, Hogben L (2020) Reconfiguration graphs of zero forcing sets. arXiv:2009.00220v1 [math.CO]"},{"key":"3835_CR19","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/0166-218X(93)90026-K","volume":"46","author":"G Gunther","year":"1993","unstructured":"Gunther G, Hartnell B, Rall DF (1993) Graphs whose vertex independence number is unaffected by single edge addition or deletion. Discret Appl Math 46:167\u2013172. https:\/\/doi.org\/10.1016\/0166-218X(93)90026-K","journal-title":"Discret Appl Math"},{"key":"3835_CR20","first-page":"55","volume":"101","author":"G Gunther","year":"1994","unstructured":"Gunther G, Hartnell B, Markus L, Rall DF (1994) Graphs with unique minimum dominating sets. Congr Numer 101:55\u201363","journal-title":"Congr Numer"},{"key":"3835_CR21","doi-asserted-by":"publisher","first-page":"233","DOI":"10.7151\/dmgt.1172","volume":"22","author":"TW Haynes","year":"2002","unstructured":"Haynes TW, Henning MA (2002) Trees with unique minimum total dominating sets. Discuss Math Graph Theory 22:233\u2013246. https:\/\/doi.org\/10.7151\/dmgt.1172","journal-title":"Discuss Math Graph Theory"},{"issue":"3","key":"3835_CR22","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/j.disc.2018.11.025","volume":"21","author":"MA Henning","year":"2019","unstructured":"Henning MA, Mohr E, Rautenbach D (2019) On the maximum number of minimum total dominating sets in forests. Discret Math Theor Comput Sci 21(3):12. https:\/\/doi.org\/10.1016\/j.disc.2018.11.025","journal-title":"Discret Math Theor Comput Sci"},{"key":"3835_CR23","doi-asserted-by":"publisher","DOI":"10.1016\/j.disopt.2022.100725","volume":"45","author":"R Herrman","year":"2022","unstructured":"Herrman R, Smith SGZ (2022) On the length of L-Grundy sequences. Discret Optim 45:100725","journal-title":"Discret Optim"},{"key":"3835_CR24","doi-asserted-by":"publisher","first-page":"1994","DOI":"10.1016\/j.dam.2012.04.003","volume":"160","author":"L Hogben","year":"2012","unstructured":"Hogben L, Huynh M, Kingsley N, Meyer S, Walker S, Young M (2012) Propagation time for zero forcing on a graph. Discret Appl Math 160:1994\u20132005","journal-title":"Discret Appl Math"},{"key":"3835_CR25","unstructured":"Hogben L, Johnson CR, Path covers of trees. Unpublished manuscript"},{"key":"3835_CR26","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/0012-365X(85)90177-3","volume":"57","author":"G Hopkins","year":"1985","unstructured":"Hopkins G, Staton W (1985) Graphs with unique maximum independent sets. Discret Math 57:245\u2013251. https:\/\/doi.org\/10.1016\/0012-365X(85)90177-3","journal-title":"Discret Math"},{"key":"3835_CR27","doi-asserted-by":"publisher","first-page":"836","DOI":"10.1016\/j.disc.2017.11.019","volume":"341","author":"D Jaume","year":"2018","unstructured":"Jaume D, Molina G (2018) Null decomposition of trees. Discret Math 341:836\u2013850. https:\/\/doi.org\/10.1016\/j.disc.2017.11.019","journal-title":"Discret Math"},{"key":"3835_CR28","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1016\/j.laa.2018.11.003","volume":"563","author":"JC-H Lin","year":"2019","unstructured":"Lin JC-H (2019) Zero forcing number, Grundy domination number, and their variants. Linear Algebra Appl 563:240\u2013254. https:\/\/doi.org\/10.1016\/j.laa.2018.11.003","journal-title":"Linear Algebra Appl"},{"key":"3835_CR29","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1016\/j.dam.2020.03.016","volume":"284","author":"G Nasini","year":"2020","unstructured":"Nasini G, Torres P (2020) Grundy dominating sequences on $$X$$-join product. Discret Appl Math 284:138\u2013149. https:\/\/doi.org\/10.1016\/j.dam.2020.03.016","journal-title":"Discret Appl Math"}],"container-title":["Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-026-03835-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40314-026-03835-w","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-026-03835-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,20]],"date-time":"2026-06-20T11:29:55Z","timestamp":1781954995000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40314-026-03835-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6,20]]},"references-count":29,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2026,12]]}},"alternative-id":["3835"],"URL":"https:\/\/doi.org\/10.1007\/s40314-026-03835-w","relation":{},"ISSN":["2238-3603","1807-0302"],"issn-type":[{"value":"2238-3603","type":"print"},{"value":"1807-0302","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,6,20]]},"assertion":[{"value":"6 April 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 April 2026","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 May 2026","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 June 2026","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no conflict of interest to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"444"}}