Bhattacharya–Friedland–Peled conjecture on maximal spectral radius of bipartite graphs

Let $G$ be a bipartite graph of size $m$ with bipartition sets $S$ and $T$, satisfying $2\leqslant |S|\leqslant |T|$ and $0<m<|S||T|$. A graph achieves the maximum spectral radius when its spectral radius is maximal among bipartite graphs with these fixed bipartition sizes and size. Bhattacharya–Friedland–Peled conjecture. If $G$ achieves the maximum spectral radius, then $G$ is obtained from a complete bipartite graph by adding one vertex and a corresponding number of edges. The supplied text does not state whether this conjecture has been resolved.