Graphs attaining an upper bound on the mixed metric dimension

Given a graph $G$, we show that the mixed metric dimension of $G$ is exactly $\mathrm{\ell }(G)+2c(G)$ if and only if $G$ is either a cactus graph in which every cycle has precisely one vertex of degree at least $3$, or a balanced $\mathrm{\Theta }$-graph, where $\mathrm{\ell }(G)$ and $c(G)$ denote the number of leaves and the cyclomatic number of $G$, respectively. This provides an affirmative answer to a conjecture proposed by Sedlar and Škrekovski (2021).