This book provides an introduction to the inverse eigenvalue problem for graphs (IEP-$ G $)
and the related area of zero forcing, propagation, and throttling. The IEP-$ G $ grew from the …

In this paper, we propose computational approaches for the zero forcing problem, the
connected zero forcing problem, and the problem of forcing a graph within a specified …

Zero forcing is an iterative graph coloring process whereby a colored vertex with a single
uncolored neighbor forces that neighbor to be colored. It is NP-hard to find a minimum zero …

Zero forcing is an iterative graph coloring process, where given a set of initially colored
vertices, a colored vertex with a single uncolored neighbor causes that neighbor to become …

This paper begins the study of reconfiguration of zero forcing sets, and more specifically, the
zero forcing graph. Given a base graph G, its zero forcing graph, Z (G), is the graph whose …

Given a graph G, one may ask:“What sets of eigenvalues are possible over all weighted
adjacency matrices of G?”(The weight of an edge is positive or negative, while the diagonal …

Zero forcing in graphs is a coloring process where a colored vertex can force its unique
uncolored neighbor to be colored. A zero forcing set is a set of initially colored vertices …

Zero forcing is an iterative graph coloring process where at each discrete time step, a
colored vertex with a single uncolored neighbor forces that neighbor to become colored. The …

Zero forcing is a combinatorial game played on a graph with the ultimate goal of changing
the colour of all the vertices at minimal cost. Originally this game was conceived as a one …

Positive semidefinite (PSD) zero forcing is a dynamic graph process in which an initial
subset of vertices are colored and may cause additional vertices to become colored through …