On the automorphism group of token graphs of complete bipartite graphs

Let G be a graph of order n and let k∈{1,2,…,n-1}. The k-token graph of G is the graph, Fk(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 the k-to...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Boletín de la Sociedad Matemática Mexicana Ročník 31; číslo 3
Hlavní autoři: Fabila-Monroy, Ruy, Trujillo-Negrete, Ana
Médium: Journal Article
Jazyk:angličtina
Vydáno: Heidelberg Springer Nature B.V 01.11.2025
Témata:
Apexes
Automorphisms
Completeness
Graph theory
Graphs
Group theory
ISSN:1405-213X, 2296-4495
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Let G be a graph of order n and let k∈{1,2,…,n-1}. The k-token graph of G is the graph, Fk(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 the k-token graph of the complete bipartite graph Km,n.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1405-213X
2296-4495
DOI:10.1007/s40590-025-00723-x