Some new general lower bounds for mixed metric dimension of graphs

Milica Milivojević Danas, Jozef Kratica, Aleksandar Savić +1

Let $G=(V,E)$ be a connected simple graph. The distance $d(u,v)$ between vertices $u$ and $v$ from $V$ is the number of edges in the shortest $u-v$ path. If $e=uv\in E$ is an edge…