Equidistant dimension of Johnson and Kneser graphs
Jozef Kratica, Mirjana \v{C}angalovi\'c, Vera, Kova\v{c}evi\'c-Vuj\v{c}i\'c

TL;DR
This paper explores the equidistant dimension of Johnson and Kneser graphs, establishing new exact values and bounds for specific graph classes, advancing understanding of their metric properties.
Contribution
It introduces properties of the equidistant dimension, derives exact values for certain Johnson and Kneser graphs, and provides bounds for others, expanding the theoretical framework.
Findings
Exact equidistant dimension for Johnson graphs J_{n,2}
Exact equidistant dimension for Kneser graphs K_{n,2}
Bounds for equidistant dimension of J_{n,3} and J_{2k,k}
Abstract
In this paper the recently introduced concept of equidistant dimension of graph is considered. Useful property of distance-equalizer set of arbitrary graph has been established. For Johnson graphs and Kneser graphs exact values for and have been derived, while for Johnson graphs it is proved that . Finally, exact value of for odd has been presented.
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 · Graph theory and applications · Topological and Geometric Data Analysis
