Theorem 1.9 (Li–Liu–Peng [1]})  
Assume that \(\delta \ge 1\)  and
\(n\ge \delta ^4+\delta ^3+4\delta ^2 +\delta +6\) .
Let \(G\)  be a connected graph with \(n\)  vertices and minimum
degree \(\delta (G)\ge \delta \) . If
\( q(G)\ge 2(n-\delta -1), \) 
