S. G. Gómez-Galicia

activity

20242026

collaborators

6 papers

math.CO2026

Automorphisms of Token Graphs That Send $4$ -Cycles Generated by Two Edges to Cycles Generated by a $4$ -Cycle and Two Tokens

Ruy Fabila-Monroy, Sergio Gerardo Gómez-Galicia, Ana Laura Trujillo-Negrete

Let $G$ be a connected graph. The $k$ -token graph of $G$ is the graph $F_{k} (G)$ whose vertex set consists of all subsets of $k$ vertices of $G$ , where two of them are adjacent whene…

math.CO2026

The forbidden structure for zero forcing number

Carlos A. Alfaro, Michael D. Barrus, Sergio Gerardo Gómez-Galicia +5

The {\it zero forcing number} of a graph $G$ , $Z (G)$ , is a well-studied parameter which arises from a color changing process and has strong connections to {\it minimum rank}, {\it…

math.CO2025

Domination number of Token Graphs

Ruy Fabila-Monroy, Sergio Gerardo Gómez-Galicia

The $k$ -token graph of $G$ is the graph, $F_{k} (G)$ , whose vertices are all the $k$ -subsets of $V (G)$ ; with two of them adjacent whenever their symmetric difference is a pair of adja…

math.CO2025

Edge-transitive token graphs as covers

Sergio G. Gómez-Galicia, Octavio B. Zapata-Fonseca

This paper uses the theory of covering graphs to characterize some of the edge-transitive graphs which can arise as token graphs.

math.CO2024

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

Ruy Fabila-Monroy, Sergio Gerardo Gómez-Galicia, Daniel Gregorio-Longino +2

Let $G$ be a connected graph on $n$ vertices and $1 \leq k \leq n - 1$ an integer. The $k$ -token graph of $G$ is the graph $F_{k} (G)$ whose vertices are all the $k$ -subsets of vertices o…

math.CO2024

On the Treewidth of Token and Johnson Graphs

Ruy Fabila-Monroy, Sergio Gerardo Gómez-Galicia, César Hernández-Cruz +1

Let $G$ be a graph on $n$ vertices and $1 \leq k \leq n$ a fixed integer. The \textit{ $k$ -token graph} of $G$ is the graph $F_{k} (G)$ whose vertex set consists of all $k$ -subsets of th…