On the Zero Forcing Number and Spectral Radius of Graphs

Abstract

In this paper, we determine the graphs (respectively, trees) with maximum spectral radius among all graphs (respectively, trees) with zero forcing number at most $k$.  As an application, we give a sharp lower bound for the zero forcing number of graphs involving the spectral radius.