Bipartite graphs with bounded vertex degree and largest eigenvalue of the form r

In this note, we generalize two results from [2] and [3] and for every Δ and Δ ≤ r ≤ Δ2 construct a family of bipartite graphs with the maximal vertex degree Δ and largest eigenvalue equal to r.