Key points are not available for this paper at this time.
In this paper the recently introduced concept of equidistant dimension eqdim (G) of graph G is considered. Useful property of distance-equalizer set of arbitrary graph G has been established. For Johnson graphs J₍, ₂ and Kneser graphs K₍, ₂ exact values for eqdim (J₍, ₂) and eqdim (K₍, ₂) have been derived, while for Johnson graphs J₍, ₃ it is proved that eqdim (J₍, ₃) n-2. Finally, exact value of eqdim (J₂₊, ₊) for odd k has been presented.
Kratica et al. (Tue,) studied this question.