On the Automorphism Group of Token Graphs of Complete Bipartite Graphs

2023/02/15 by Ruy Fabila‐Monroy, Fabila-Monroy, Ruy, Ana Laura Trujillo-Negrete +1
Mathematics · Computer Science · #Finite Group Theory Research #Coding theory and cryptography #Graph theory and applications

paper · pdf · doi:10.48550/arxiv.2302.07914

Abstract

Let G be a graph of order n and let k∈ \1,2,…,n-1\. The k-token graph of G is the graph, 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 the k-token graph of the complete bipartite graph K_m,n.

Related

• On the Automorphisms of Token Graphs Generated by 2-cuts with the Same Neighbours
• Generalized Token Graphs
• Well-covered Token Graphs
• Connected (C₄,Diamond)-free Graphs Are Uniquely Reconstructible from Their Token Graphs
• On the spectra of token graphs of cycles and other graphs