3 problems

Let $G$) be a graph, and let fixed propagation time equal to one mean that the minimum and maximum propagation times of minimum forcing sets are both one. The source defines standa…

For a graph $G$, the positive semidefinite propagation time interval is the interval of integers from the minimum to the maximum positive semidefinite propagation times of minimum…

Let $G$ be a connected graph. A PSD fast join is a graph of order $n\geq 2$ such that $G\cong K_n$ or … for $t\geq 2$ and positive integers $n_i,m_i$ with $n=\sum_{i=1}^t n_i+m_i$.…