On the zero forcing number and spectral radius of graphs (Q2121770)

The relationship between the zero forcing number and the spectral radius of graphs is investigated. Given an order \(n\) and a zero forcing number \(k\), the authors prove that the maximum spectral radius is attained by graphs \(P_n\) if \(k=1\), \(K_{k-1} \nabla P_{n-k+1}\) if \(2\le k \le n-2\) and \(K_n\) if \(k=n-1\). From this, the authors find a sharp lower bound for the zero forcing number in terms of order and spectral radius. They also study the maximum spectral radius attaining trees given the order and the zero forcing number using the usual grafting transformation technique.