On the Automorphism Group of Token Graphs of Complete Bipartite Graphs

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 Km,n.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…