A note on $k$-metric dimensional graphs

Samuel G. Corregidor, Álvaro Martínez-Pérez

Given a graph $G=(V,E)$, a set $S\subset V$ is called a $k$-\emph{metric generator} for $G$ if any pair of different vertices of $G$ is distinguished by at least $k$ elements of…