Connectivity is one important theme in graph throry. This article studies a kind of particular graphk-equidistance graph by the use of a new concept

link number

proposed in . We acquire the following conclusion: k-equidistance graph is block; The upper bounds of max-degree and clique number in k-equidistance graph; The radium of the spanning tree of k-equidistance graph is k.