A lower bound on the spectral radius of the universal cover of a graph

For bipartite graphs with minimal degree at least two, we prove that ρ(G̃)⩾dL−1+dR−1, where dL, dR are the average degrees on the left and right hand sides.