The conjecture characterizing graphs with fixed PSD propagation time one
Let GGG be a connected graph. A PSD fast join is a graph of order n≥2n\geq 2n≥2 such that G≅KnG\cong K_nG≅Kn or … for t≥2t\geq 2t≥2 and positive integers ni,min_i,m_ini,mi with n=∑i=1tni+min=\sum_{i=1}^t n_i+m_in=∑i=1tni+mi.…