Edge and mixed metric dimension of Johnson graphs
Jozef Kratica, Mirjana Cangalovi\'c, Vera, Kova\v{c}evi\'c-Vuj\v{c}i\'c, Milica Milivojevi\'c Danas

TL;DR
This paper investigates the edge and mixed metric dimensions of Johnson graphs, establishing a new lower bound and deriving exact values for specific cases, thereby advancing understanding of graph metric properties.
Contribution
Introduces a new tight lower bound for the edge metric dimension of Johnson graphs and determines exact values for the case when k=2.
Findings
Established a new lower bound for $eta_E(J_{n,k})$
Derived exact values for $eta_E(J_{n,2})$ and $eta_M(J_{n,2})$
Proved $eta_E(J_{n,2}) = eta_M(J_{n,2})$
Abstract
In this paper, both edge and mixed metric dimensions of Johnson graphs are considered. A new tight lower bound for based on hitting sets has been obtained. Using this bound, exact values for and have been derived, and it is proved that .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph Labeling and Dimension Problems
