Theorem 3.8 (see [1]})  
Let \(k \ge 1, \delta \ge k+2\)  and \(n\)  be sufficiently large.
If \(G\)  is a subgraph of \(H_{n,k,\delta }\)  or \(L_{n,k,\delta }\) 
and the minimum degree \(\delta (G) \ge \delta \) , then
\( \lambda (G) < n -\delta +k-1, \) 
