Reinhart's extremal normalized distance Laplacian conjecture

Let $G$ be a graph on $n$ vertices, and let $\mathcal{D}^\mathcal{L}(G)$ be its normalized distance Laplacian matrix. Write $KPK_{n_1,n_2,n_3}$ for the graph obtained by connecting two cliques on $n_1$ and $n_3$ vertices through a path on $n_2$ vertices. Reinhart's extremal conjecture. The maximum spectral radius of $\mathcal{D}^\mathcal{L}$ among graphs on $n$ vertices tends to $2$ as $n\to\infty$, and this maximum is achieved by $KPK_{n_1,n_2,n_3}$ for some $n_1+n_2+n_3=n+2$.

This conjecture concerns the asymptotic extremal behavior of the normalized distance Laplacian spectral radius and identifies a proposed family of extremal graphs. The supplied source does not indicate whether the conjecture has been resolved.