4 problems

Let $G$ be a graph of order $n(G)$ that admits a multiset resolving set. Its multiset dimension is denoted by $\operatorname{dim_{m}}(G)$. Hfidh's conjecture. … This conjecture ask…

Let $F_n$ be the folded $n$-cube, and let $\beta(F_n)$ and $\Psi(F_n)$ denote its metric dimension and minimal doubly resolving set number, respectively. Folded-hypercube conjectur…

Resolving-set conjecture for near-triangulations. Every near-triangulation has a resolving set of size

Chartrand et al.'s realizability conjecture. There exists a connected graph $G$ such that