Blocking zero forcing processes in Cartesian products of graphs

DOI10.1016/J.DAM.2020.06.002MaRDI QIDQ2197448zbMATH OpenOpenAlexFDO

Authors Xierui Shen, Denise Sakai Troxell, MinhKhang Vu, Nathaniel J. Karst

Publication date 31 August 2020

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2020.06.002

zbMATH Keywords

Cartesian productzero blocking numberzero forcing number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph operations (line graphs, products, etc.) (05C76)

Recommendations

• On the zero blocking number of rectangular, cylindrical, and Möbius grids
• Throttling for zero forcing and variants
• The failed zero forcing number of a graph
• The zero forcing polynomial of a graph
• Probalistic zero forcing in graphs

Cites work

• A lower bound on the zero forcing number
• Complexity and computation of connected zero forcing
• Computational approaches for zero forcing and related problems
• Effects of vertex degrees on the zero-forcing number and propagation time of a graph
• Forcing brushes
• Minimum rank and zero forcing number for butterfly networks
• On the complexity of failed zero forcing
• On the total forcing number of a graph
• On the zero blocking number of rectangular, cylindrical, and Möbius grids
• Positive semidefinite zero forcing numbers of two classes of graphs
• Restricted power domination and zero forcing problems
• Some bounds on the zero forcing number of a graph
• The failed zero forcing number of a graph
• The relationship between \(k\)-forcing and \(k\)-power domination
• The zero forcing polynomial of a graph
• Throttling positive semidefinite zero forcing propagation time on graphs
• Zero forcing in iterated line digraphs
• Zero forcing in triangulations
• Zero forcing propagation time on oriented graphs
• Zero forcing sets and the minimum rank of graphs

Cited in

(7)

• On extremal graphs for zero forcing number
• On the zero blocking number of rectangular, cylindrical, and Möbius grids
• k-forcing number for Cartesian product of some graphs
• Fuzzification of Zero Forcing Process
• Immune sets in monotone infection rules. Characterization and complexity
• An approximation algorithm for zero forcing
• On the size of immune sets in the k-PULL infection model

This page was built for publication: Blocking zero forcing processes in Cartesian products of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2197448)