2024/06/25 by Jozef Kratica, Kratica, Jozef, Mirjana Čangalović +3
Computer Science · Mathematics · #05C12 #Combinatorics (math.CO) #FOS: Mathematics #G.2.2 #Graph Labeling and Dimension Problems #Graph theory and applications #Topological and Geometric Data Analysis
paper · pdf · doi:10.48550/arxiv.2406.17870
openalex publication_date 2024/06/25 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.