We introduce a generalization of the concept of a chronological list of forces, called a relaxed chronology. This concept is used to introduce a new way of formulating the standard zero forcing process, which we refer to as parallel increasing path covers, or PIPs. The combinatorial properties of PIPs are utilized to identify bounds comparing standard zero forcing propagation time to positive semidefinite propagation time. A collection of paths within a set of PSD forcing trees, called a path bundle, is used to identify the PSD forcing analog of the reversal of a standard zero forcing process, as well as to draw a connection between PSD forcing and rigid-linkage forcing.
We introduce a generalization of the concept of a chronological list of forces, called a relaxed chronology. This concept is used to introduce a new way of formulating the standard zero forcing process, which we refer to as parallel increasing path covers, or PIPs. The combinatorial properties of PIPs are utilized to identify bounds comparing standard zero forcing propagation time to positive semidefinite propagation time. A collection of paths within a set of PSD forcing trees, called a path bundle, is used to identify the PSD forcing analog of the reversal of a standard zero forcing process, as well as to draw a connection between PSD forcing and rigid-linkage forcing.
2 December 2025 in The Electronic Journal of Linear Algebra
This article studies the minimum rank of a (simple, undirected) graph, which is the minimum rank among all matrices in a space determined by the graph. It determines the exact set of graphs on eight vertices for which the nullity of a minimum rank matrix does not coincide with a bound determined by the zero forcing number of a graph. Although the goal was to determine which eight-vertex graphs satisfy maximum nullity equal to the zero forcing number, it also establishes several additional methods to assist in the computation of minimum rank for general graphs.
7 February 2020 in Linear Algebra and its Applications