Liu–Shan–Xu conjecture on the maximum edge Mostar index of bicyclic graphs

Let $m$ be the size of a bicyclic graph, and let $B_m$ and $B^5_m$ denote the bicyclic graphs shown in the source's Figures X and Y, respectively. Liu–Shan–Xu's conjecture. If $m$ is sufficiently large, then $B_m$ and $B^5_m$ have the maximum edge Mostar index among bicyclic graphs of size $m$. The conjecture concerns the extremal edge Mostar index among bicyclic graphs. The source paper disproves it by determining the unique graph maximizing the edge Mostar index for bicyclic graphs with fixed size.