On the Automorphism Group of Token Graphs of Complete Bipartite Graphs

MaRDI QIDQ6508837arXivFDO

Authors R. Fabila-Monroy, Ana Laura Trujillo-Negrete

Published in arXiv

Abstract: Let $G$ be a graph of order $n$ and let $kin1,2,ldots,n-1$. The $k$-token graph of $G$ is the graph, $F_k(G)$, whose vertices are all the $k$-subsets of vertices of $G$, where two such $k$-sets are adjacent whenever their symmetric difference is an edge of $G$. In this paper we determine the automorphism group of $F_k(K_{m,n})$. We also give a lower bound on the size of the automorphism group of $F_k(G)$, when $G$ is a non-prime (with respect to the Cartesian product) connected graph, and show that this bound is tight for the $r$-cube.

This page was built for publication: On the Automorphism Group of Token Graphs of Complete Bipartite Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6508837)