Maximum sigma_t-irregularity conjecture for connected triangle-free graphs

Let $G$ be a connected triangle-free graph on $n$ vertices. Write $\sigma_t(G)$ for its $\sigma_t$-irregularity. Among such graphs, the extremal complete bipartite graphs are conjectured to have maximum $\sigma_t(G)$.

Triangle-free extremal conjecture. Among connected triangle-free graphs on $n$ vertices, the extremal complete bipartite graphs have the maximum $\sigma_t(G)$-irregularity.

The paper proves the corresponding extremal result among complete bipartite graphs and proposes this conjecture as the extension to all connected triangle-free graphs; its status is not resolved in the supplied text.