Name
Abstract | ||
|---|---|---|
For a graph G and integer k ≥ 1, we define the token graph F k (G) to be the graph with vertex set all k-subsets of V(G), where two vertices are adjacent in F k (G) whenever their symmetric difference is a pair of adjacent vertices in G. Thus vertices of F k (G) correspond to configurations of k indistinguishable tokens placed at distinct vertices of G, 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. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1007/s00373-011-1055-9 | Graphs and Combinatorics |
Keywords | DocType | Volume |
distinct vertex,adjacent vertex,k indistinguishable token,unoccupied vertex,vertex set,F k,graph G,token graph F k,token graph,Token Graphs,integer k | Journal | 28 |
Issue | ISSN | Citations |
3 | 1435-5914 | 1 |
PageRank | References | Authors |
0.35 | 0 | 6 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ruy Fabila-MonroyDavid | 1 | 54 | 8.75 |
| David Flores-Peñaloza | 2 | 32 | 6.44 |
| Clemens Huemer | 3 | 167 | 24.93 |
| Ferran Hurtado | 4 | 744 | 86.37 |
| Jorge Urrutia | 5 | 1064 | 134.74 |
| David R. Wood | 6 | 1073 | 96.22 |