Token Graphs
Ruy Fabila-Monroy, David Flores-Pe\~naloza, Clemens Huemer, Ferran, Hurtado, Jorge Urrutia, David R. Wood

TL;DR
This paper introduces token graphs, a new way to model configurations of indistinguishable tokens on a graph, and explores their fundamental properties such as connectivity, diameter, and Hamiltonian paths.
Contribution
It defines token graphs based on symmetric differences and investigates their structural properties, a novel approach in graph theory.
Findings
Token graphs' connectivity and diameter are characterized.
Conditions for Hamiltonian paths in token graphs are identified.
Properties like cliques and chromatic number are analyzed.
Abstract
For a graph and integer , we define the token graph to be the graph with vertex set all -subsets of , where two vertices are adjacent in whenever their symmetric difference is a pair of adjacent vertices in . Thus vertices of correspond to configurations of indistinguishable tokens placed at distinct vertices of , where two configurations are adjacent whenever one configuration can be reached from the other by moving one token along an edge from its current position to an unoccupied vertex. This paper introduces token graphs and studies some of their properties including: connectivity, diameter, cliques, chromatic number, Hamiltonian paths, and Cartesian products of token graphs.
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.
