A lower bound on the $k$-conversion number of graphs of maximum degree $k+۱$

‎‎We derive a new sharp lower bound on the $k$-conversion number of graphs of maximum degree $k+۱$‎. ‎This generalizes a result of W.~Staton [Induced forests in cubic graphs‎, ‎Discrete Math.‎,۴۹ (‎۱۹۸۴) ‎۱۷۵--۱۷۸‎]‎, ‎which established a lower bound on the $k$-conversion number of $(k+۱)$-regular graphs‎.