On the Automorphisms of Token Graphs Generated by 2-cuts with the Same Neighbours

Abstract Let G be a connected graph on n vertices and $$1 \le k \le n-1$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mn>1</mml:mn> <mml:mo>≤</mml:mo> <mml:mi>k</mml:mi> <mml:mo>≤</mml:mo> <mml:mi>n</mml:mi> <mml:mo>-</mml:mo> <mml:mn>1</mml:mn> </mml:mrow> </mml:math> an integer. The k -token graph of G is the graph $$F_k(G)$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:msub> <mml:mi>F</mml:mi> <mml:mi>k</mml:mi> </mml:msub> <mml:mrow> <mml:mo>(</mml:mo> <mml:mi>G</mml:mi> <mml:mo>)</mml:mo> </mml:mrow> </mml:mrow> </mml:math> , whose vertices are all the k -subsets of vertices of G , two of which are adjacent whenever their symmetric difference is an edge of G . Every automorphism of G induces an automorphism of $$F_k(G)$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:msub> <mml:mi>F</mml:mi> <mml:mi>k</mml:mi> </mml:msub> <mml:mrow> <mml:mo>(</mml:mo> <mml:mi>G</mml:mi> <mml:mo>)</mml:mo> </mml:mrow> </mml:mrow> </mml:math> in a natural way. Suppose that $$S:=\{x,y\}$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>S</mml:mi> <mml:mo>:</mml:mo> <mml:mo>=</mml:mo> <mml:mo>{</mml:mo> <mml:mi>x</mml:mi> <mml:mo>,</mml:mo> <mml:mi>y</mml:mi> <mml:mo>}</mml:mo> </mml:mrow> </mml:math> is a cut set of G , such that x and y have the same neighbours in $$G\setminus \{x,y\}$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>G</mml:mi> <mml:mo>\</mml:mo> <mml:mo>{</mml:mo> <mml:mi>x</mml:mi> <mml:mo>,</mml:mo> <mml:mi>y</mml:mi> <mml:mo>}</mml:mo> </mml:mrow> </mml:math> . In this paper, we show that there exists a large number of automorphisms of $$F_k(G)$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:msub> <mml:mi>F</mml:mi> <mml:mi>k</mml:mi> </mml:msub> <mml:mrow> <mml:mo>(</mml:mo> <mml:mi>G</mml:mi> <mml:mo>)</mml:mo> </mml:mrow> </mml:mrow> </mml:math> defined by S that are not induced by automorphisms of G . We also describe the group produced by all such 2-cuts of G .

Authors

Institutions

Publication Details

Journal
Graphs and Combinatorics
Published
2025-12-03
DOI
https://doi.org/10.1007/s00373-025-03001-9
Primary Topic
Advanced Graph Theory Research
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

On the Automorphisms of Token Graphs Generated by 2-cuts with the Same Neighbours

Ruy Fabila‐Monroy, Ana Laura Trujillo-Negrete, Teresa I. Hoekstra-Mendoza, Daniel Gregorio-Longino et al.
Graphs and Combinatorics
Advanced Graph Theory Research
article

On the Automorphisms of Token Graphs Generated by 2-cuts with the Same Neighbours

Ruy Fabila‐Monroy, Ana Laura Trujillo-Negrete, Teresa I. Hoekstra-Mendoza, Daniel Gregorio-Longino, Sergio Gerardo Gómez-Galicia
article en

Abstract

Abstract Let G be a connected graph on n vertices and $$1 \le k \le n-1$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mn>1</mml:mn> <mml:mo>≤</mml:mo> <mml:mi>k</mml:mi> <mml:mo>≤</mml:mo> <mml:mi>n</mml:mi> <mml:mo>-</mml:mo> <mml:mn>1</mml:mn> </mml:mrow> </mml:math> an integer. The k -token graph of G is the graph $$F_k(G)$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:msub> <mml:mi>F</mml:mi> <mml:mi>k</mml:mi> </mml:msub> <mml:mrow> <mml:mo>(</mml:mo> <mml:mi>G</mml:mi> <mml:mo>)</mml:mo> </mml:mrow> </mml:mrow> </mml:math> , whose vertices are all the k -subsets of vertices of G , two of which are adjacent whenever their symmetric difference is an edge of G . Every automorphism of G induces an automorphism of $$F_k(G)$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:msub> <mml:mi>F</mml:mi> <mml:mi>k</mml:mi> </mml:msub> <mml:mrow> <mml:mo>(</mml:mo> <mml:mi>G</mml:mi> <mml:mo>)</mml:mo> </mml:mrow> </mml:mrow> </mml:math> in a natural way. Suppose that $$S:=\{x,y\}$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>S</mml:mi> <mml:mo>:</mml:mo> <mml:mo>=</mml:mo> <mml:mo>{</mml:mo> <mml:mi>x</mml:mi> <mml:mo>,</mml:mo> <mml:mi>y</mml:mi> <mml:mo>}</mml:mo> </mml:mrow> </mml:math> is a cut set of G , such that x and y have the same neighbours in $$G\setminus \{x,y\}$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>G</mml:mi> <mml:mo>\</mml:mo> <mml:mo>{</mml:mo> <mml:mi>x</mml:mi> <mml:mo>,</mml:mo> <mml:mi>y</mml:mi> <mml:mo>}</mml:mo> </mml:mrow> </mml:math> . In this paper, we show that there exists a large number of automorphisms of $$F_k(G)$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:msub> <mml:mi>F</mml:mi> <mml:mi>k</mml:mi> </mml:msub> <mml:mrow> <mml:mo>(</mml:mo> <mml:mi>G</mml:mi> <mml:mo>)</mml:mo> </mml:mrow> </mml:mrow> </mml:math> defined by S that are not induced by automorphisms of G . We also describe the group produced by all such 2-cuts of G .

Graphs and CombinatoricsVol. 42(1)
Mathematics Research Center (MX), Centro de Investigación y de Estudios Avanzados del Instituto Politécnico Nacional (MX), Universidad Nacional Autónoma de México (MX)
Consejo Nacional de Ciencia y Tecnología, Universidad Nacional Autónoma de México, Agencia Nacional de Investigación y Desarrollo
Openalex Percentile: Top 62%
Advanced Graph Theory Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.