A study of a combination of distance domination and resolvability in graphs

Dwi Agustin Retnowardani, Muhammad Imam Utoyo, Dafik +2

For $k\ge 1$, in a graph $G=(V,E)$, a set of vertices $D$ is a distance $k$-dominating set of $G$, if any vertex in $V\setminus D$ is at distance at most $k$ from some vertex in…