The metric dimension of the supertoken graph of the complete graph
Statement
Let be the supertoken graph whose vertices represent configurations of indistinguishable tokens on the complete graph , with adjacency given by moving one token along an edge of . The metric dimension of a graph is the minimum cardinality of a resolving set, namely a set of vertices whose distance vectors distinguish all vertices.
Metric-dimension conjecture. The metric dimension of the supertoken graph is
The preceding proposition establishes the upper bound ; the conjecture asserts that this bound is sharp. The supplied text does not provide a lower-bound proof or evidence of resolution.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.