2024/07/10 by Jozef Kratica, Kratica, Jozef, Mirjana Čangalović +5
Computer Science · #05C12 #Combinatorics (math.CO) #FOS: Mathematics #G.2.1 #G.2.2 #Graph Labeling and Dimension Problems
paper · pdf · doi:10.48550/arxiv.2407.07851
openalex publication_date 2024/07/10 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In this paper, both edge and mixed metric dimensions of Johnson graphs Jn,k are considered. A new tight lower bound for βE(Jn,k) based on hitting sets has been obtained. Using this bound, exact values for βE(Jn,2) and βM(Jn,2) have been derived, and it is proved that βE(Jn,2) = βM(Jn,2).