Access the full text.
Sign up today, get DeepDyve free for 14 days.
Randy Davila, Michael Henning (2017)
Total Forcing and Zero Forcing in Claw-Free Cubic GraphsGraphs and Combinatorics, 34
W. Haemers (2008)
Zero forcing sets and minimum rank of graphsJournal of the American Geriatrics Society
D. Amos, Y. Caro, Randy Davila, R. Pepper (2014)
Upper bounds on the k-forcing number of a graphDiscret. Appl. Math., 181
J. Lin (2017)
Zero forcing number, Grundy domination number, and their variantsLinear Algebra and its Applications
António Girão, Gábor Mészáros, Stephen Smith (2016)
On a conjecture of Gentner and RautenbachDiscret. Math., 341
Francesco Barioli, W. Barrett, Shaun Fallat, H. Hall, L. Hogben, B. Shader, P. Driessche, H. Holst (2013)
Parameters Related to Tree‐Width, Zero Forcing, and Maximum Nullity of a GraphJournal of Graph Theory, 72
B. Brešar, Csilla Bujtás, Tanja Gologranc, S. Klavžar, Gasper Kosmrlj, Tilen Marc, Balázs Patkós, Z. Tuza, Máté Vizer (2017)
On Grundy Total Domination Number in Product GraphsDiscussiones Mathematicae Graph Theory, 41
G. Nasini, P. Torres (2018)
Grundy dominating sequences on X-join productDiscret. Appl. Math., 284
Michael Gentner, L. Penso, D. Rautenbach, U. Souza (2016)
Extremal values and bounds for the zero forcing numberDiscret. Appl. Math., 214
B. Brešar, Tim Kos, P. Torres (2019)
Grundy domination and zero forcing in Kneser graphsArs Math. Contemp., 17
Michael Gentner, D. Rautenbach (2016)
Some bounds on the zero forcing number of a graphDiscret. Appl. Math., 236
B. Brešar, Tanja Gologranc, Martin Milanič, D. Rall, Romeo Rizzi (2014)
Dominating sequences in graphsDiscret. Math., 336
Michael Henning, S. Klavžar, D. Rall (2015)
Total Version of the Domination GameGraphs and Combinatorics, 31
B. Brešar, Tanja Gologranc, Tim Kos (2016)
Dominating sequences under atomic changes with applications in Sierpi\'{n}ski and interval graphsarXiv: Combinatorics
B. Brešar, S. Klavžar, D. Rall (2010)
Domination Game and an Imagination StrategySIAM J. Discret. Math., 24
L. Hogben, J. Lin, B. Shader (2019)
The Inverse Eigenvalue Problem of a Graph50 Years of Combinatorics, Graph Theory, and Computing
Randy Davila, Michael Henning (2018)
Zero Forcing in Claw-Free Cubic GraphsBulletin of the Malaysian Mathematical Sciences Society, 43
Francesco Barioli, W. Barrett, Shaun Fallat, H. Hall, Leslie Hogben, Leslie Hogben, B. Shader, P. Driessche, H. Holst (2010)
Zero forcing parameters and minimum rank problemsLinear Algebra and its Applications, 433
B. Brešar, Michael Henning, D. Rall (2016)
Total dominating sequences in graphsDiscret. Math., 339
Fatemeh Taklimi, Shaun Fallat, Karen Meagher (2013)
On the Relationships between Zero Forcing Numbers and Certain Graph CoveringsSpecial Matrices, 2
B. Brešar, Csilla Bujtás, Tanja Gologranc, S. Klavžar, Gasper Kosmrlj, Balázs Patkós, Z. Tuza, Máté Vizer (2017)
Grundy dominating sequences and zero forcing setsDiscret. Optim., 26
Katherine Benson, Daniela Ferrero, Mary Flagg, Veronika Furst, L. Hogben, V. Vasilevska, Brian Wissman (2018)
Zero forcing and power domination for graph productsThe Australasian Journal of Combinatorics, 70
B. Brešar, Csilla Bujtás, Tanja Gologranc, S. Klavžar, Gasper Kosmrlj, Balázs Patkós, Z. Tuza, Máté Vizer (2016)
Dominating Sequences in Grid-Like and Toroidal GraphsElectron. J. Comb., 23
T. Haynes, S. Hedetniemi, S. Hedetniemi, Michael Henning (2002)
Domination in Graphs Applied to Electric Power NetworksSIAM J. Discret. Math., 15
Publisher's Note Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations
M. Alishahi, E. Rezaei-Sani, Elahe Sharifi (2020)
Maximum nullity and zero forcing number on graphs with maximum degree at most threeDiscret. Appl. Math., 284
Shaun Fallat, B. Shader, L. Hogben, J. Lin (2020)
The Inverse Eigenvalue Problem of a Graph, Zero Forcing, and Related ParametersNotices of the American Mathematical Society, 67
Given a finite graph G, the maximum length of a sequence (v1,…,vk)\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$$(v_1,\ldots ,v_k)$$\end{document} of vertices in G such that each vi\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$$v_i$$\end{document} dominates a vertex that is not dominated by any vertex in {v1,…,vi-1}\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$$\{v_1,\ldots ,v_{i-1}\}$$\end{document} is called the Grundy domination number, γgr(G)\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$$\gamma _\mathrm{gr}(G)$$\end{document}, of G. A small modification of the definition yields the Z-Grundy domination number, which is the dual invariant of the well-known zero forcing number. In this paper, we prove that γgr(G)≥n+⌈k2⌉-2k-1\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$$\gamma _\mathrm{gr}(G) \ge \frac{n + \lceil \frac{k}{2} \rceil - 2}{k-1}$$\end{document} holds for every connected k-regular graph of order n different from Kk+1\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$$K_{k+1}$$\end{document} and 2C4¯\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$$\overline{2C_4}$$\end{document}. The bound in the case k=3\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$$k=3$$\end{document} reduces to γgr(G)≥n2\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$$\gamma _\mathrm{gr}(G)\ge \frac{n}{2}$$\end{document}, and we characterize the connected cubic graphs with γgr(G)=n2\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$$\gamma _\mathrm{gr}(G)=\frac{n}{2}$$\end{document}. If G is different from K4\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$$K_4$$\end{document} and K3,3\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$$K_{3,3}$$\end{document}, then n2\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$$\frac{n}{2}$$\end{document} is also an upper bound for the zero forcing number of a connected cubic graph, and we characterize the connected cubic graphs attaining this bound.
Bulletin of the Malaysian Mathematical Sciences Society – Springer Journals
Published: Nov 1, 2021
Keywords: Grundy domination number; Zero forcing; Regular graph; Cubic graph; 05C69; 05C35
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.