Zero forcing number, Grundy domination number, and their variants

DOI10.1016/J.LAA.2018.11.003zbMath1405.05104arXiv1706.00798OpenAlexW2964124830MaRDI QIDQ1713312

Jephian C.-H. Lin

Publication date: 24 January 2019

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1706.00798

zbMATH Keywords

minimum rankmaximum nullityzero forcingGrundy domination

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (17)

On the zero forcing number and spectral radius of graphs ⋮ Uniform length dominating sequence graphs ⋮ On the L-Grundy domination number of a graph ⋮ On the length of L-Grundy sequences ⋮ Graphs with equal Grundy domination and independence number ⋮ The \((d-2)\)-leaky forcing number of \(Q_d\) and \(\ell\)-leaky forcing number of \(GP(n,1)\) ⋮ Z-domination game ⋮ Computation of Grundy dominating sequences in (co-)bipartite graphs ⋮ On Grundy total domination number in product graphs ⋮ On the zero forcing number of the complement of graphs with forbidden subgraphs ⋮ Bounds on zero forcing using (upper) total domination and minimum degree ⋮ Grundy domination and zero forcing in regular graphs ⋮ Brushing number and zero-forcing number of graphs and their line graphs ⋮ Loop zero forcing and Grundy domination in planar graphs and claw-free cubic graphs ⋮ On the zero forcing number of a graph involving some classical parameters ⋮ Grundy domination and zero forcing in Kneser graphs ⋮ Vertex sequences in graphs

Cites Work

• Total dominating sequences in graphs
• Using a new zero forcing process to guarantee the strong Arnold property
• Dominating sequences in grid-like and toroidal graphs
• Dominating sequences in graphs
• Linearly independent vertices and minimum semidefinite rank
• Minimum rank problems
• Minimum rank of skew-symmetric matrices described by a graph
• Zero forcing parameters and minimum rank problems
• Grundy dominating sequences and zero forcing sets
• Logic circuits from zero forcing
• Zero forcing sets and the minimum rank of graphs
• Odd Cycle Zero Forcing Parameters and the Minimum Rank of Graph Blowups
• Domination Game and an Imagination Strategy
• Parameters Related to Tree‐Width, Zero Forcing, and Maximum Nullity of a Graph
• Dominating sequences under atomic changes with applications in Sierpiński and interval graphs
• On the complexity of the positive semidefinite zero forcing number

This page was built for publication: Zero forcing number, Grundy domination number, and their variants