Radio Labelings of Distance Graphs

R. Čada, J. Ekstein, P. Holub +1

A radio $k$-labeling of a connected graph $G$ is an assignment $c$ of non negative integers to the vertices of $G$ such that $$|c(x)-c(y)|\ge k+1-d(x,y),$$ for any two vertic…