Let $n\in\mathbb{N}$ be a positive integer, and let $[n] = \{1,\ldots,n\}$. We set $S_n$ for the set of all bijections $\varphi:[n]\to [n]$. Let $G= ([n], E)$ be a simple, undirected graph, and let $\varphi\in S_n$ We define the label distance number of $G$ in the following way: $$\lambda(G) = ...