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 Jn,2 and Kneser graphs Kn,2 exact values for eqdim(Jn,2) and eqdim(Kn,2) have been derived, while for Johnson graphs Jn,3 it is proved that eqdim(Jn,3) ≤ n-2. Finally, exact value of eqdim(J2k,k) for odd k has been presented.
No takes yet. Share an insight, caveat, or question.
Kratica et al. (2024) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: