Upper bounds for positive semidefinite propagation time

The tight upper bound pt+(G) < is established for the positive semidefinite propagation time of a graph in terms of its positive semidefinite zero forcing number. To prove this bound, two methods of transforming one positive semidefinite zero forcing set into another and algorithms implementing these methods are presented. Consequences of the bound, including a tight Nordhaus-Gaddum sum upper bound on positive semidefinite propagation time, are established.

Automated summary

The paper establishes the upper bound for the positive semidefinite propagation time of a graph in terms of its positive semidefinite zero forcing number. Two methods and algorithms for transforming one positive semidefinite zero forcing set into another are presented to prove this bound. Consequences of the bound, including a tight Nordhaus-Gaddum sum upper bound on positive semidefinite propagation time, are established.