Resolving sets for Johnson and Kneser graphs

Abstract

A set of vertices $S$ in a graph $G$ is a {\em resolving set} for $G$ if, for any two vertices $u,v$, there exists $x\in S$ such that the distances $d(u,x)\ne d(v,x)$. In this paper, we consider the Johnson graphs $J(n,k)$ and Kneser graphs $K(n,k)$, and obtain various constructions of resolving sets for these graphs. As well as general constructions, we show that various interesting combinatorial objects can be used to obtain resolving sets in these graphs, including (for Johnson graphs) projective planes and symmetric designs, as well as (for Kneser graphs) partial geometries, Hadamard matrices, Steiner systems and toroidal grids.

23 pages, 2 figures, 1 table

References in corpus (1)

• Hypergraphs for computing determining sets of Kneser graphs

Cited by in corpus (7)

• Distance-regular graphs
• Several Roman domination graph invariants on Kneser graphs
• Is it possible to determine a point lying in a simplex if we know the distances from the vertices?
• On the metric dimension of imprimitive distance-regular graphs
• The Equidistant Dimension of Graphs
• Metric Dimension of Amalgamation of Graphs
• Partition dimension of projective planes